docs(DP): update EggDropping.java
This commit is contained in:
parent
09d5cb01f3
commit
6ff87322e6
@ -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
|
||||
|
||||
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;
|
||||
|
||||
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][1] = 1; // One trial for one floor
|
||||
}
|
||||
@ -23,16 +22,13 @@ public class EggDropping
|
||||
|
||||
// Using bottom-up approach in DP
|
||||
|
||||
for (int i = 2; i <= n; i++)
|
||||
{
|
||||
for (int j = 2; j <= m; j++)
|
||||
{
|
||||
for (int i = 2; i <= n; i++) {
|
||||
for (int j = 2; j <= m; j++) {
|
||||
eggFloor[i][j] = Integer.MAX_VALUE;
|
||||
for (x = 1; x <= j; x++)
|
||||
{
|
||||
result = 1 + Math.max(eggFloor[i-1][x-1], eggFloor[i][j-x]);
|
||||
for (x = 1; x <= 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
|
||||
if (result < eggFloor[i][j])
|
||||
eggFloor[i][j] = result;
|
||||
}
|
||||
@ -42,11 +38,9 @@ public class EggDropping
|
||||
return eggFloor[n][m];
|
||||
}
|
||||
|
||||
//testing program
|
||||
public static void main(String args[])
|
||||
{
|
||||
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
|
||||
// result outputs min no. of trials in worst case for n eggs and m floors
|
||||
int result = minTrials(n, m);
|
||||
System.out.println(result);
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user