-
Notifications
You must be signed in to change notification settings - Fork 84
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
删除并获得点数 #253
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
习题
思路
对于数组nums中的每一个元素,我们都可以选择获取它的值或者删除它
所以对于每一个数字,是否选择它可以基于两种前置结果:
所以本题可以采用动态规划的方式来进行解答
使用一个map来保存每个数字出现的个数
接下来写出递归公式
dp[0] = 0
dp[1] 是数字1 出现的次数
dp[i] = max(dp[i - 1], dp[i - 2] i * map[i])
解答
javascript
go
The text was updated successfully, but these errors were encountered: