374,375. Guess Number Higher or Lower I,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 at least 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.

1. 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?

思路1： 参考细雨呢喃

最小最大化：最少需要多少钱，使得不管选的数是几，都能保证赢。

动规： 设 solution(i,j) 为不管从i到j中选几，能保证赢的最少钱数。 第一步 共有n种猜法，假设猜x；被猜数y可能是x，可能在1～x-1,可能在x+1~n，所以对于第一步猜x，要想保证y在1到n中任意取值都能赢所需钱为：solution(1,n) = x + Max(  solution(1,x-1) ,  solution(x+1,n) ). 第一步n种情况中使得solution(1,n)最小的那个x为最优解。分而治之，递归下去：直到只有两个数i，i+1，只需猜i，如果不对就是i+1（到一个数L＝＝R不会猜错，所以不花钱，返回0）。用一个二维数组dp[][]的右上半部分保存所有算过的solution(i,j)避免重复计算。dp对角线及左下半边为0.从dp[i][i+1]算起，最后要看的是dp[1][n]。

public class Solution {
    public int getMoneyAmount(int n) {
        int[][] dp = new int[n+1][n+1];
        return solve(dp, 1, n);
    }
    int solve(int[][] dp, int L, int R) {

<span style="white-space:pre">	</span>//只有一个数，不会猜错
        if(L>=R) return 0;

<span style="white-space:pre">	</span>//已经求出的子集的最优解不用再算了
        if(dp[L][R]!=0) return dp[L][R];
        dp[L][R] = Integer.MAX_VALUE;

<span style="white-space:pre">	</span>//i从L到R找最优解
        for (int i = L; i <= R; i++) {

<span style="white-space:pre">		</span>//<span style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">分而治之，</span><span style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">递归下去：直到</span><span style="color: rgb(51, 51, 51); font-family: "Helvetica Neue", Helvetica, Arial, sans-serif; font-size: 14px;">只有两个数i，i+1，当L＝＝R时返回0</span>
		dp[L][R] = Math.min(dp[L][R], i + Math.max(solve(dp,L,i-1),solve(dp,i+1,R)));
	}
	return dp[L][R];
    }
}