文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
Delete and Earn
class Solution {
public:
int deleteAndEarn(vector<int>& nums) {
int points = 0;
int point[10001] = {0};
for(int num : nums) {
point[num] += num;
}
for(int i = 2; i < 10001; i++) {
point[i] = max(point[i - 2] + point[i], point[i - 1]);
}
return point[10000];
}
};
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
https://leetcode.com/problems/delete-and-earn/description...
740.删除并获得点数 https://leetcode-cn.com/problems/delete-and-e...
leetcode 196[https://leetcode.cn/problems/delete-duplicat...
来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/delete...
https://leetcode.com/problems/delete-node-in-a-bst/
https://leetcode.com/problems/delete-node-in-a-linked-lis...
链接：https://leetcode.com/problems/delete-node-in-a-linked-...
https://leetcode.com/problems/delete-node-in-a-linked-lis...
题目链接 https://leetcode.com/problems/delete-operation-for-t...
本文标题：Leetcode 740. Delete and Earn
本文链接：https://www.haomeiwen.com/subject/gorksqtx.html
网友评论