algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 09:06:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add tests, remove main in DiceThrow/DP.java (#5644)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-10 00:46:20 +05:30
committed by GitHub
parent 6ddb26f48d
commit 4a0e46dae6
3 changed files with 58 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
src/main/java/com/thealgorithms/dynamicprogramming/DiceThrow.java
View File

@ -9,6 +9,7 @@ keep on counting the results that sum to X. This can be done using recursion. */
/* Hence, storing the results of the solved sub-problems saves time.
And it can be done using Dynamic Programming(DP).
// Time Complexity: O(m * n * x) where m is number of faces, n is number of dice and x is given sum.
Following is implementation of Dynamic Programming approach. */
// Code ---->
// Java program to find number of ways to get sum 'x' with 'n'
@ -43,21 +44,4 @@ final class DP {
return table[n][x];
}
public static void main(String[] args) {
System.out.println(findWays(4, 2, 1));
System.out.println(findWays(2, 2, 3));
System.out.println(findWays(6, 3, 8));
System.out.println(findWays(4, 2, 5));
System.out.println(findWays(4, 3, 5));
}
}
/*
OUTPUT:
0
2
21
4
6
*/
// Time Complexity: O(m * n * x) where m is number of faces, n is number of dice and x is given sum.