740. 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数组映射为count数组，num[i]的数量即为count[num[i]]的值。此时不需要考虑delete nums[i] + 1，因为从前往后扫描，每次只需考虑nums[i] - 1。如果count[k-1]>0，即值k-1存在， use = k * count[k] + avoid; avoid = m; 如果k-1 不存在，那么 use = k * count[k] + m; avoid = m;
其中use为第K次earn的值+加上之前的最大值，avoid为k-2次前的最大值，m为k-1次前的最大值。

代码

class Solution {
public:
    int deleteAndEarn(vector<int>& nums) {
        vector<int> count(10001,0);
        for (int x: nums) count[x]++;
        int avoid = 0, use = 0, prev = -1;

        for (int k = 0; k <= 10000; ++k) {
             if (count[k] > 0) {
                int m =avoid>use?avoid:use;
                if (k - 1 != prev) {
                    use = k * count[k] + m;
                    avoid = m;
                } else {
                    use = k * count[k] + avoid;
                    avoid = m;
                }
                prev = k;
             }

        }

        return avoid>use?avoid:use;
    }
};