# [leetcode]Guess Number Higher or Lower II

### Question

We are playing the Guess Game. The game is as follows:

I pick a number from 1 to n. You have to guess which number I picked.

Every time you guess wrong, I’ll tell you whether the number I picked is higher or lower.

However, when you guess a particular number x, and you guess wrong, you pay $x. You win the game when you guess the number I picked. ### Example n = 10, I pick 8. First round: You guess 5, I tell you that it's higher. You pay$5.
Second round: You guess 7, I tell you that it's higher. You pay $7. Third round: You guess 9, I tell you that it's lower. You pay$9.

Game over. 8 is the number I picked.

You end up paying $5 +$7 + $9 =$21.

Given a particular n ≥ 1, find out how much money you need to have to guarantee a win.

### Solution

class Solution {
public:
#define inf 0x3fffffff
int getMoneyAmount(int n) {
vector<vector<int> > dp;
dp.resize(n+1);
for (int i = 0; i < n+1; i++) dp[i].resize(n+1, 0);
for (int i = 1; i <= n; i++) dp[i][i] = 0;
for (int i = 1; i <= n-1; i++) dp[i][i+1] = i;
for (int i = 1; i <= n-2; i++) dp[i][i+2] = i+1;

for (int len = 3; len <= n-1; len++) {
for (int i = 1; i <= n-len; i++) {
int min_val = inf;
for (int j = i; j <= i+len; j++) {
if (j == i) min_val = min(min_val, j+dp[j+1][i+len]);
else if (j == i+len) min_val = min(min_val, dp[i][i+len-1]+j);
else min_val = min(min_val, j+max(dp[i][j-1], dp[j+1][i+len]));
}
dp[i][i+len] = min_val;
}
}
return dp[1][n];
}
};