Question

两个鸡蛋问题：

你有2个鸡蛋您可以使用100层高的建筑物鸡蛋可能非常坚硬或非常脆弱意味着如果从一楼掉落可能会破裂，或者如果从100层落下则可能甚至不会破裂。鸡蛋是相同的。你需要弄清楚一幢100层高的建筑物的最高楼层，一个鸡蛋可以在不破坏的情况下掉落现在的问题是你需要做多少滴。你可以在这个过程中打破2个鸡蛋。

我知道动态编程的这个问题的解决方案。我想跟踪解决方案以及最小尝试次数。即我必须尝试获得最小尝试次数的楼层。

# include <stdio.h>
# include <limits.h>


// A utility function to get maximum of two integers
int max(int a, int b) { return (a > b)? a: b; }


/* Function to get minimum number of trails needed in worst
  case with n eggs and k floors */
int eggDrop(int n, int k)
{
    /* A 2D table where entery eggFloor[i][j] will represent minimum
       number of trials needed for i eggs and j floors. */
    int eggFloor[n+1][k+1];
    int res;
    int i, j, x;

    // We need one trial for one floor and0 trials for 0 floors
    for (i = 1; i <= n; i++)
    {
        eggFloor[i][1] = 1;
        eggFloor[i][0] = 0;
    }

    // We always need j trials for one egg and j floors.
    for (j = 1; j <= k; j++)
        eggFloor[1][j] = j;

    // Fill rest of the entries in table using optimal substructure
    // property
    for (i = 2; i <= n; i++)
    {
        for (j = 2; j <= k; j++)
        {
            eggFloor[i][j] = INT_MAX;
            for (x = 1; x <= j; x++)
            {
                res = 1 + max(eggFloor[i-1][x-1], eggFloor[i][j-x]);
                if (res < eggFloor[i][j])
                    eggFloor[i][j] = res;
            }
        }
    }

    // eggFloor[n][k] holds the result
    return eggFloor[n][k];
}

/* Driver program to test to pront printDups*/
int main()
{
    int n = 2, k = 36;
    printf ("\nMinimum number of trials in worst case with %d eggs and "
             "%d floors is %d \n", n, k, eggDrop(n, k));
    return 0;
}

Answer 1

您只需要存储x的值，以便为您提供最佳解决方案：

int eggDrop(int n, int k)
{
    /* A 2D table where entery eggFloor[i][j] will represent minimum
       number of trials needed for i eggs and j floors. */
    int eggFloor[n+1][k+1];
    int floor[n+1][k+1];
    int res;
    int i, j, x;

    // We need one trial for one floor and0 trials for 0 floors
    for (i = 1; i <= n; i++)
    {
        eggFloor[i][1] = 1;
        eggFloor[i][0] = 0;
    }

    // We always need j trials for one egg and j floors.
    for (j = 1; j <= k; j++)
        eggFloor[1][j] = j;

    // Fill rest of the entries in table using optimal substructure
    // property
    for (i = 2; i <= n; i++)
    {
        for (j = 2; j <= k; j++)
        {
            eggFloor[i][j] = INT_MAX;
            for (x = 1; x <= j; x++)
            {
                res = 1 + max(eggFloor[i-1][x-1], eggFloor[i][j-x]);
                if (res < eggFloor[i][j]) {
                    eggFloor[i][j] = res;
                    floor[i][j] = x;
                }                        
            }
        }
    }

    // eggFloor[n][k] holds the result
    return eggFloor[n][k];
}

最后，floor [i] [j]包含你有鸡蛋和j层时需要尝试的地板。

蛋滴的跟踪表

1 个答案: