2-28-superEggDrop.md

题目

链接

思路

int superEggDrop(int K, int N) {
      vector<int> dp(K + 1, 0);
      int m;
      for (m = 0; dp[K] < N; m++)
          for (int k = K; k > 0; --k)
              dp[k] += dp[k - 1] + 1;
      return m;
  }
  ```