2019-11-11 LeetCode in Rust LeetCode 1155. Number of Dice Rolls With Target Sum Problem Statement impl Solution { pub fn num_rolls_to_target(d: i32, f: i32, target: i32) -> i32 { const MOD : u64 = 1e9 as u64 + 7; let mut dp = vec![vec![0; target as usize + 1]; d as usize + 1]; dp[0][0] = 1; for i in 1..d as usize + 1 { for j in 1..f as usize + 1 { for k in j..target as usize + 1 { dp[i][k] = (dp[i][k] + dp[i - 1][k - j]) % MOD; } } } return dp[d as usize][target as usize] as i32; }} Newer LeetCode 1153. String Transforms Into Another String Older 1197. Minimum Knight Moves