[leetcode] Delete and Earn

题目

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中所有的相同的数都选取出来：这样子即增加的收益，也没有进一步的删除。
我们现在重新排序一下nums数组并计数，设置一个长度为nums中最大数字的N数组。N[i]为i在nums中出现的次数。设$f(n)$为选择出n的数字时，可以取得的最大值。我们有状态转移方程：
f ( i ) = m a x { f ( i − 1 ) , f ( j ) + N ( i ) × i } , j = m a x { 0 , i − 2 } f(i)=max\{f(i-1),f(j)+N(i)\times i\},\quad j=max\{0, i-2\} f(i)=max{f(i−1),f(j)+N(i)×i},j=max{0,i−2}

代码

class Solution {
public:
    int deleteAndEarn(vector<int>& nums) {
        if(nums.size() == 0) {
            return 0;
        }
        int max_num = INT_MIN;
        for(auto n : nums) {
            if(n > max_num) {
                max_num = n;
            }
        }
        vector<int> N(max_num + 1, 0);
        vector<int> f(max_num + 1, 0);
        for(auto n : nums) {
            ++N[n];
        }
        for(int i = 1; i <= max_num; ++i) {
            int j = max(0, i - 2);
            f[i] = max(f[i - 1], f[j] + N[i] * i);
        }
        return f[max_num];
    }
};