题目
Given an array nums of integers, you can perform operations on the array.
In each operation, you pick any nums[i] and delete it to earn nums[i] points. After, you must delete every element equal to nums[i] - 1 or nums[i] + 1.
You start with 0 points. Return the maximum number of points you can earn by applying such operations.
Example 1:
Input: nums = [3, 4, 2]
Output: 6
Explanation:
Delete 4 to earn 4 points, consequently 3 is also deleted.
Then, delete 2 to earn 2 points. 6 total points are earned.
Example 2:
Input: nums = [2, 2, 3, 3, 3, 4]
Output: 9
Explanation:
Delete 3 to earn 3 points, deleting both 2's and the 4.
Then, delete 3 again to earn 3 points, and 3 again to earn 3 points.
9 total points are earned.
Note:
The length of nums is at most 20000.
Each element nums[i] is an integer in the range [1, 10000].
题意
给一串数组, 你可以选择任意的 nums[i] n u m s [ i ] , 并且获得 nums[i] n u m s [ i ] 点, 然后必须删除 nums[i] n u m s [ i ] 和所有等于 nums[i]−1 n u m s [ i ] − 1 和 nums[i]+1 n u m s [ i ] + 1 的元素
分析
- 由于要按大小删除数, 所以我先对数组进行排序.
- 又能观察到如果要选择nums[i], 那么所有等于nums[i]的其他数都要选上. 所以接下来我对数组进行了统计 : vector<pair<int,int>>count v e c t o r < p a i r < i n t , i n t >> c o u n t 的pair对存储了数值和其出现的次数
- 从小到大选, 因为不会选到比自己大的数, 只需要考虑比自身少一的数不能选. 状态转移方程:
res[i+1]=max(res[i],res[k]+((count[i]).first)∗((count[i]).second)) r e s [ i + 1 ] = m a x ( r e s [ i ] , r e s [ k ] + ( ( c o u n t [ i ] ) . f i r s t ) ∗ ( ( c o u n t [ i ] ) . s e c o n d ) )
其中res[i+1]表示选到第i个数值时的最大值(第i个可选可不选)
k表示i之前一个不等于该数值-1的数在count数组中的位置.
时间复杂度 O(nlogn) O ( n l o g n )
实现
class Solution {
public:
int deleteAndEarn(vector<int>& nums) {
sort(nums.begin(), nums.end());
vector<pair<int, int>> count;
int last = 0, k = 0;
pair <int,int> temp= make_pair(0, 1);
count.push_back(temp);
for (int i = 0, j = 0; i < nums.size(); i++) {
if (nums[i] == last) {
count[j].second++;
} else {
temp = make_pair(nums[i], 1);
count.push_back(temp);
last = nums[i];
j++;
}
}
std::vector<int> res(count.size()+1);
for (int i = 0; i < count.size(); i++) {
if (i != 0 && (count[i].first-1 == count[i-1].first)) k = i-1;
else k = i;
res[i+1] = max(res[i], res[k]+((count[i]).first)*((count[i]).second));
}
return res[count.size()];
}
};