-
-
Notifications
You must be signed in to change notification settings - Fork 9.5k
已发布文章的代码错误 #577
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
这是来自QQ邮箱的自动回复邮件。您好,邮件已收到,我将会尽快给您回复。
|
您好,您的来信已收到,我会尽快给您回复的!
|
您的邮件我已收到,谢谢! --吴宇鹏
|
这是来自QQ邮箱的假期自动回复邮件。你好,我最近正在休假中,无法亲自回复你的邮件。我将在假期结束后,尽快给你回复。
|
我已经收到了,会尽快查看的,谢谢
|
已收到,谢谢,我会尽快回复。
|
是的。 不过更具体地应该说: 在 464. 我能赢吗 这道题中应该 - 2, 因为最后一位没用到过。 其他题目大家要具体问题具体分析。 我更新一下 Github 文章 https://github.com/azl397985856/leetcode/blob/master/problems/464.can-i-win.md?rgh-link-date=2023-01-12T12%3A14%3A10Z 。 公众号由于平台限制,无法更新。 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
暂时不知道往哪提交issue, 先交到这, 作者有幸看到再折叠掉好了.
简单来说, 状态压缩DP教程中len() API实现中, 判断len()==N的方法应该是 picked == (1 << (maxChoosableInteger + 1)) - 2, 而不是 -1, 因为二进制表示中的第0位默认为0, 全程没有用过. 因此len()==N时, picked应该等于1....10, 而不是1...11.
状态压缩DP教程 暂时只看到这两个网址
https://github.com/azl397985856/leetcode/blob/master/problems/464.can-i-win.md
https://mp.weixin.qq.com/s?__biz=MzI4MzUxNjI3OA==&mid=2247486874&idx=1&sn=0f27ddd51ad5b92ef0ddcc4fb19a3f5e&chksm=eb88c183dcff4895209c4dc4d005e3bb143cc852805594b407dbf3f4718c60261f09c2849f70&token=1227596150&lang=zh_CN#rd
The text was updated successfully, but these errors were encountered: