Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

docs(DP): update EggDropping.java

Browse Source
This commit is contained in:
Libin Yang 2019-02-23 21:06:32 +08:00 committed by GitHub
parent 09d5cb01f3
commit 6ff87322e6
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 46 additions and 52 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

98
Dynamic Programming/EggDropping.java
View File

@ -1,53 +1,47 @@
//Dynamic Programming solution for the Egg Dropping Puzzle /**
public class EggDropping * Dynamic Programming solution for the Egg Dropping Puzzle
{ */
public class EggDropping {
// min trials with n eggs and m floors
// min trials with n eggs and m floors
private static int minTrials(int n, int m)
{ private static int minTrials(int n, int m) {
int eggFloor[][] = new int[n+1][m+1]; int[][] eggFloor = new int[n + 1][m + 1];
int result, x; int result, x;
for (int i = 1; i <= n; i++) for (int i = 1; i <= n; i++) {
{ eggFloor[i][0] = 0; // Zero trial for zero floor.
eggFloor[i][0] = 0; // Zero trial for zero floor. eggFloor[i][1] = 1; // One trial for one floor
eggFloor[i][1] = 1; // One trial for one floor }
}
// j trials for only 1 egg
// j trials for only 1 egg
for (int j = 1; j <= m; j++)
for (int j = 1; j <= m; j++) eggFloor[1][j] = j;
eggFloor[1][j] = j;
// Using bottom-up approach in DP
// Using bottom-up approach in DP
for (int i = 2; i <= n; i++) {
for (int i = 2; i <= n; i++) for (int j = 2; j <= m; j++) {
{ eggFloor[i][j] = Integer.MAX_VALUE;
for (int j = 2; j <= m; j++) for (x = 1; x <= j; x++) {
{ result = 1 + Math.max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]);
eggFloor[i][j] = Integer.MAX_VALUE;
for (x = 1; x <= j; x++) // choose min of all values for particular x
{ if (result < eggFloor[i][j])
result = 1 + Math.max(eggFloor[i-1][x-1], eggFloor[i][j-x]); eggFloor[i][j] = result;
}
//choose min of all values for particular x }
if (result < eggFloor[i][j]) }
eggFloor[i][j] = result;
} return eggFloor[n][m];
} }
}
public static void main(String args[]) {
return eggFloor[n][m]; int n = 2, m = 4;
} // result outputs min no. of trials in worst case for n eggs and m floors
int result = minTrials(n, m);
//testing program System.out.println(result);
public static void main(String args[]) }
{
int n = 2, m = 4;
//result outputs min no. of trials in worst case for n eggs and m floors
int result = minTrials(n, m);
System.out.println(result);
}
} }