LeetCode 375. Guess Number Higher or Lower II 扔鸡蛋变种

最新推荐文章于 2024-03-13 23:00:16 发布

taoqick

最新推荐文章于 2024-03-13 23:00:16 发布

阅读量139

点赞数

分类专栏： leetcode 算法

本文链接：https://blog.csdn.net/taoqick/article/details/108152921

版权

算法同时被 2 个专栏收录

474 篇文章 6 订阅

订阅专栏

leetcode

231 篇文章 0 订阅

订阅专栏

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

f[l][r]=min(x+max(f[l][x-1],f[x+1][r])) 其中x-1>=l,x+1<=r，对应的代码是：

class Solution:
    def getMoneyAmount(self, n):
        f = [[0] * (n + 1) for _ in range(n + 1)]
        for i in range(1,n):
            f[i][i+1] = i
        for w in range(2,n):
            for l in range(1,n+1-w):
                r=l+w
                f[l][r] = min(x+max(f[x+1][r],f[l][x-1])
                              for x in range(l+1,r))
        return f[1][n]