forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathguess-number-higher-or-lower-ii.cpp
40 lines (38 loc) · 1.22 KB
/
guess-number-higher-or-lower-ii.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// Time: O(n^3)
// Space: O(n^2)
class Solution {
public:
int getMoneyAmount(int n) {
vector<vector<int>> dp(n + 1, vector<int>(n + 1)); // dp[i][j]: min pay in [i+1, j+1)
for (int j = 0; j <= n; ++j) {
for (int i = j - 2; i >= 0; --i) {
dp[i][j] = numeric_limits<int>::max();
for (int k = i; k < j; ++k) {
if (max(dp[i][k], dp[k + 1][j]) < dp[i][j] - (k + 1)) {
dp[i][j] = (k + 1) + max(dp[i][k], dp[k + 1][j]);
}
}
}
}
return dp[0][n];
}
};
// Time: O(n^3)
// Space: O(n^2)
class Solution2 {
public:
int getMoneyAmount(int n) {
vector<vector<int>> dp(n + 1, vector<int>(n + 1)); // dp[i][j]: min pay in [i+1, j+1)
for (int i = n - 1; i >= 0; --i) {
for (int j = i + 2; j <= n; ++j) {
dp[i][j] = numeric_limits<int>::max();
for (int k = i; k < j; ++k) {
if (max(dp[i][k], dp[k + 1][j]) < dp[i][j] - (k + 1)) {
dp[i][j] = (k + 1) + max(dp[i][k], dp[k + 1][j]);
}
}
}
}
return dp[0][n];
}
};