[leetcode] 375. Guess Number Higher or Lower II

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.

Hint:

1. The best strategy to play the game is to minimize the maximum loss you could possibly face. Another strategy is to minimize the expected loss. Here, we are interested in the first scenario.
2. Take a small example (n = 3). What do you end up paying in the worst case?
3. Check out this article if you're still stuck.
4. The purely recursive implementation of minimax would be worthless for even a small n. You MUST use dynamic programming. 
5. As a follow-up, how would you modify your code to solve the problem of minimizing the expected loss, instead of the worst-case loss?

解法一：

这一个是recursion的去做dp。dp[j][i]表示i-j区间上最小的cost。这里最重要的是dp的递归方程式, dp[j][i] = min_k\in(j:i) (k+max(dp[j][k-1],dp[k+1][i])。

class Solution {
public:
    int getMoneyAmount(int n) {
        vector<vector<int> > dp(n+1,vector<int>(n+1,0));
        return DP(dp,1,n);
    }
    
    int DP(vector<vector<int>> &dp, int start, int end){
        if(start>=end) return 0;
        if(dp[start][end]!=0) return dp[start][end];
        
        int res = INT_MAX;
        for(int i=start; i<=end; i++){
            int tmp = i+max(DP(dp,start,i-1),DP(dp,i+1,end));
            res = min(tmp, res);
        }
        dp[start][end] = res;
        return res;
    }
    
};

解法二：

非递归的方法去做dp，用bottom-up的方式。

class Solution {
public:
    int getMoneyAmount(int n) {
        vector<vector<int> > dp(n+1,vector<int>(n+1,0));
        
        for(int i= 2; i<=n; i++){
            for(int j= i-1; j>0; j--){
                int global_min = INT_MAX;
                for(int k=j+1; k<i; k++){
                    int local_max = k+max(dp[j][k-1],dp[k+1][i]);
                    global_min = min(global_min,local_max);
                }
                dp[j][i]=j+1==i?j:global_min;
            }
        }
        
        return dp[1][n];
    }
};