diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/num_dice_roll_target_sum.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/num_dice_roll_target_sum.cpp')
-rw-r--r-- | other/num_dice_roll_target_sum.cpp | 21 |
1 files changed, 0 insertions, 21 deletions
diff --git a/other/num_dice_roll_target_sum.cpp b/other/num_dice_roll_target_sum.cpp deleted file mode 100644 index abb7596..0000000 --- a/other/num_dice_roll_target_sum.cpp +++ /dev/null @@ -1,21 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int numRollsToTarget(int n, int k, int target) { - int mod = 1000000007; - vvd dp(n + 1, vector<int>(target + 1, 0)); - dp[0][0] = 1; - for (int i = 1; i <= n; i++) - for (int j = 1; j <= target; j++) - for (int x = 1; x <= k; x++) - if (x <= j) - dp[i][j] = ((dp[i][j] % mod) + (dp[i - 1][j - x] % mod)) % mod; - return dp[n][target]; - } -}; - -int main() { - Solution obj; - cout << obj.numRollsToTarget(1, 6, 3); -} |