LeetCode-374&375.Guess Number Higher or Lower

374 https://leetcode.com/problems/guess-number-higher-or-lower/

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 is higher or lower.

You call a pre-defined API guess(int num) which returns 3 possible results (-1, 1, or 0):

-1 : My number is lower
 1 : My number is higher
 0 : Congrats! You got it!

Example:

n = 10, I pick 6.

Return 6.

二分法

int guessNumber(int n) 
    {
        int l = 1, r = n, mid;
        while (true)
    	{
    		mid = l+(r-l) / 2;
    		if (guess(mid) == 0)
    			return mid;
    		if (guess(mid) == 1)
    			l = mid + 1; 
    		else
    			r = mid - 1;
    	}
    	return 0;
    }

375 https://leetcode.com/problems/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 thefirst 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?

动态规划

dp[i][j]表示猜测[i,j]最少需要的花费

目标：求解dp[1][n]

转移式

dp[i][j] = min (i<=k<=j) { k + max(dp[i][k-1], dp[k+1][j]) }

如果猜测k，则在子问题[i,k-1]和[k+1,j]中找最大值，然后在所有k中查找最小值

int getMoneyAmount(int n)
    {
        if (n < 2)
    		return 0;
    	vector<vector<int>> dp(n + 1, vector<int>(n + 1, 0));
    	int j, tmp;
    	for (int l = 1; l < n; l++)
    	{
    		for (int i = 1; i<= n-l; i++)
    		{
    			j = i + l;
    			if (l == 1)
    				dp[i][j] = i;
    			else if (l == 2)
    				dp[i][j] = i + 1;
    			else
    			{
    				tmp = INT_MAX;
    				for (int k = i; k < j; k++)
    					tmp = min(tmp, k + max(dp[i][k - 1], dp[k + 1][j]));
    				dp[i][j] = tmp;
    			}
    		}
    	}	
    	return dp[1][n];
    }

参考：

http://www.w2bc.com/article/161062

https://discuss.leetcode.com/topic/51358/java-dp-solution/2