LeetCode 1884. 鸡蛋掉落-两枚鸡蛋
class Solution {
public:
int twoEggDrop(int n)
{
int i, j;
int f;
int dp[n + 1][3];
memset(dp, 0x3f3f3f, sizeof(dp));
for (i = 1; i <= n; i++) {
dp[i][1] = i;
}
dp[0][1] = dp[0][2] = 0;
//dp[i][x]表示,在第i层有x个鸡蛋,他是有前面的几层推导过来的。
for (i = 1; i <= n; i++) {
for (j = 1; j <=i; j++) {
dp[i][2] = fmin(dp[i][2], fmax(dp[j-1][1], dp[i-j][2]) + 1);
}
}
return dp[n][2];
}
};