Skip to content

Commit 9a34a22

Browse files
Merge pull request #1 from arun-kushwaha04/arun-kushwaha04-patch-1
Added Solution of Leetcode problem 1155(C++)
2 parents dea7913 + b152031 commit 9a34a22

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
class Solution {
2+
public:
3+
vector<vector<int>> dp;
4+
int mod = 1e9+7;
5+
int solve(int n, int k, int sum){
6+
if(n == 0 && sum == 0)return 1;
7+
if(n == 0 || sum <= 0)return 0;
8+
9+
if(dp[n][sum] != -1)return dp[n][sum];
10+
11+
long long ans = 0;
12+
for(int i = 1; i <= k ; i++){
13+
if(sum >= i){
14+
ans += (solve(n-1,k,sum-i)%mod);
15+
ans%=mod;
16+
}
17+
}
18+
return dp[n][sum] = (int)ans;
19+
}
20+
int numRollsToTarget(int n, int k, int target) {
21+
dp.resize(n+1,vector<int>(target+1,-1));
22+
return solve(n,k,target);
23+
}
24+
};

0 commit comments

Comments
 (0)