algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-12 22:56:11 +08:00
Code Issues 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
1 changed files with 46 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
Dynamic Programming/EggDropping.java
View File

@ -1,17 +1,16 @@
//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
} }
@ -23,13 +22,10 @@ public class EggDropping
// 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++) {
for (int j = 2; j <= m; j++)
{
eggFloor[i][j] = Integer.MAX_VALUE; eggFloor[i][j] = Integer.MAX_VALUE;
for (x = 1; x <= j; x++) for (x = 1; x <= j; x++) {
{
result = 1 + Math.max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]); result = 1 + Math.max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]);
// choose min of all values for particular x // choose min of all values for particular x
@ -42,9 +38,7 @@ public class EggDropping
return eggFloor[n][m]; return eggFloor[n][m];
} }
//testing program public static void main(String args[]) {
public static void main(String args[])
{
int n = 2, m = 4; int n = 2, m = 4;
// result outputs min no. of trials in worst case for n eggs and m floors // result outputs min no. of trials in worst case for n eggs and m floors
int result = minTrials(n, m); int result = minTrials(n, m);