leetcode习题整理——动态规划篇——lc375 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.

题目分析： 比较典型的2维DP问题，对于每一个区间的数(l,r), 我们任取其中一个数K，则可将该区域划分为三个空间， (l,k-1), (k), (k+1, r)， 则此时所获得的钱数为 count(l, k-1) + k + count(k+1，r), 对l到r区间的所有数都采取相同的方式，并取其中的最小值，我们就可以求得count(l,r)， 通过bottom-up的动态规划，去记录每一小段的结果，最终返回（0，n）区间的结果即是该题目的解。

代码如下：

    public int getMoneyAmount(int n) {
        int[][]M = new int[n+1][n+1];
        for(int i = M.length-2; i >=1; i--) {
            for (int j = i+1; j < M.length; j++) {
                int globalMin = Integer.MAX_VALUE;
                for (int k = i; k < j; k++){
                     globalMin = Math.min(globalMin, Math.max(k+M[i][k-1], k+M[k+1][j]));   
                }
                M[i][j] = globalMin;
            }
        }
        return M[1][n];
    }