[TODO] LeetCode #375: Guess Number Higher or Lower II
来源:互联网 发布:财务总监知乎 编辑:程序博客网 时间:2024/05/01 22:16
Problem Statement
(Source) 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 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.
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?
Solution
class Solution(object): def getMoneyAmount(self, n): """ :type n: int :rtype: int """ dp = [[0 for i in xrange(n + 1)] for j in xrange(n + 1)] for length in xrange(2, n + 1): for i in xrange(1, n + 2 - length): j = i + length - 1 # Minimize the maximum loss. dp[i][j] = float('inf') for k in xrange(i, j + 1): left, right = k, k if k > i: left += dp[i][k - 1] if k < j: right += dp[k + 1][j] # Min-max. dp[i][j] = min(dp[i][j], max(left, right)) return dp[1][n]
- [TODO] LeetCode #375: Guess Number Higher or Lower II
- leetcode:Guess Number Higher or Lower II
- [Leetcode]Guess Number Higher or Lower II
- 【Leetcode】Guess Number Higher or Lower II
- [LeetCode] Guess Number Higher or Lower II
- [leetcode-375]Guess Number Higher or Lower II(java)
- 【LEETCODE】375- Guess Number Higher or Lower II [Python]
- leetcode(375):Guess Number Higher or Lower II
- [Leetcode 375] Guess Number Higher or Lower II
- LeetCode No.375 Guess Number Higher or Lower II
- [LeetCode]374. Guess Number Higher or Lower【&375. Guess Number Higher or Lower II】
- LeetCode 375. Guess Number Higher or Lower II
- LeetCode—375. Guess Number Higher or Lower II
- leetcode 375. Guess Number Higher or Lower II 解题小结
- leetcode 375. Guess Number Higher or Lower II
- leetcode.375. Guess Number Higher or Lower II
- [leetcode] 375. Guess Number Higher or Lower II 解题报告
- LeetCode 375. Guess Number Higher or Lower II
- 流
- MYSQL 建表、修改表语句
- JAVA反射机制
- 修改jquery.datatable 搜索框触发事件
- unity 游戏整体速度的调节
- [TODO] LeetCode #375: Guess Number Higher or Lower II
- 嵌入式软件工程师相关的应聘要求
- Spark master local配置
- Java IO - Arrays
- 分账和无协议商户数据有误的处理过程
- **C++智能指针部分指针的实现**
- BZOJ 1004 Cards(polya+dp)
- HTML基础知识(一)
- 跑步前后拉伸活动的具体步骤和内容