[leetcode]375. Guess Number Higher or Lower II

最新推荐文章于 2020-05-29 02:24:37 发布

原创最新推荐文章于 2020-05-29 02:24:37 发布 · 597 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode 同时被 2 个专栏收录

473 篇文章

订阅专栏

动态规划

91 篇文章

订阅专栏

本文介绍了一种通过动态规划解决猜数字游戏的问题，目的是在1到n的范围内找到一个数字，使猜错的成本总和最小。通过选择合适的数字i，并确保i加上剩余区间的最大支付金额最小，从而实现成本最小化。

题目链接：https://leetcode.com/problems/guess-number-higher-or-lower-ii/#/description

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.

解题思路：动态规划。在1~n的数里面，选一个i,使得 i+max(res(start,i-1),res(i+1,end) )达到最小。即求最小的最大值问题。

class Solution{
public:
    int getMoneyAmount(int n)
    {
        vector<vector<int>> res(n+1,vector<int>(n+1,0));
        return minPay(res,1,n);
    }

    int minPay(vector<vector<int>>& res,int start,int end)
    {
        if(start>=end)
            return 0;
        if(res[start][end]!=0)
            return res[start][end];
        int minValue=INT_MAX;
        for(int i=start;i<=end;i++)
        {
            int pay=i+max(minPay(res,start,i-1),minPay(res,i+1,end));
            minValue=min(minValue,pay);
        }
        res[start][end]=minValue;
        return minValue;
    }
};