375. Guess Number Higher or Lower II

原创 2016年08月30日 10:09:54

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.


题意分析:
首先定义dp[i][j],代表如果我们在区间[i,j]内进行查找,所需要最少cost来保证找到结果。我们要求的就是dp[1][n];
给定范围1--n,你想要获取win,最少要花多少money才能保证win.
对于给定区间[i,j],因为目标数字是i~j中的任何一个都有可能。对于目标数字每取一个数,我们猜测k(i<=k<=j)我们可能出现以下三种结果:
1. k 就是答案,此时子问题的额外 cost = 0 ,当前位置总 cost  = k + 0;
2. k 过大,此时我们的有效区间缩小为 [i , k - 1] 当前操作总 cost  = k + dp[start][k - 1];
3. k 过小,此时我们的有效区间缩小为 [k + 1 , j] 当前操作总 cost  = k + dp[k + 1][j];
由于我们需要 “保证得到结果”,也就是说对于指定 k 的选择,我们需要准备最坏情况 cost 是上述三种结果生成的 subproblem 中cost 最大的那个;
我们只需要求得所有的结果下的最小的一个满足题意的条件就可以保证能够使用这个money赢下一种可能性的目标。


class Solution {
public:
   
    int getMinCost(int s,int e,vector<vector<int>>& data)
    {
         if(s>=e)return 0;
         if(data[s][e]!=0)return data[s][e];
         int minCost = INT_MAX;
         for(int i=s;i<=e;i++)
         {
            minCost = min(minCost,i+max(getMinCost(s,i-1,data),getMinCost(i+1,e,data)));
         }
         data[s][e]=minCost;
         return data[s][e];

    }
    int getMoneyAmount(int n) {
        vector<vector<int>> data(n+1,vector<int>(n+1,0));
        return getMinCost(1,n,data);

    }
};




思路参考http://www.1point3acres.com/bbs/thread-197552-1-1.html



版权声明:本文为博主原创文章,未经博主允许不得转载。

375. Guess Number Higher or Lower

374. Guess Number Higher or Lower We are playing the Guess Game. The game is as follows: I...

leetcode 375. Guess Number Higher or Lower II 解题小结

题目是这样子的,跟374很像: We are playing the Guess Game. The game is as follows: I pick a number from ...
  • adfsss
  • adfsss
  • 2016年07月19日 02:08
  • 2321

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 g...

[leetcode] 375. Guess Number Higher or Lower II 解题报告

题目链接: https://leetcode.com/problems/guess-number-higher-or-lower-ii/ We are playing the Guess G...

[leetcode-375]Guess Number Higher or Lower II(java)

这道题只要利用动态规划的算法,我们需要注意这样一个事实。 E(i,j) = min( k + max(E(i,k-1),E(k+1,j))(本来想用语言描述一下,但是怎么说,都表达不清楚) 其中E...
  • zdavb
  • zdavb
  • 2016年07月17日 16:48
  • 1357

Leetcode 375. Guess Number Higher or Lower II

@stupidbird911 said in [How does one think up DP solutions for these types of problems?](/post/12269...

LeetCode 375. Guess Number Higher or Lower II

375. Guess Number Higher or Lower II We are playing the Guess Game. The game is as follows: I...

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

375. Guess Number Higher or Lower II -Medium

Question We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. ...

Leetcode 375 - Guess Number Higher or Lower II(区间dp)

题意猜数字游戏,给定一个n,假设我从1到n里面选择了一个数作为我的target,如果我这次猜的x并且猜错了, 那么需要付出代价x,能够猜出1到n里面任意一个数的最小代价。思路这道题和之前的Guess ...
  • Lzedo
  • Lzedo
  • 2017年02月01日 18:14
  • 112
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:375. Guess Number Higher or Lower II
举报原因:
原因补充:

(最多只允许输入30个字)