剑指 Offer 60. n个骰子的点数

class Solution {
public:
vector twoSum(int n) {
int dp[15][70];
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= 6; i ++) { dp[1][i] = 1; } for (int i = 2; i <= n; i ++) { for (int j = i; j <= 6*i; j ++) { for (int cur = 1; cur <= 6; cur ++) { if (j - cur <= 0) { break

剑指 Offer 60. n个骰子的点数最先出现在Python成神之路。