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].

分析：先用桶排来排序，顺便记录每一个数字出现的次数，关于到前i个数字的集合的最大值显然有以下的状态转移：
dp[i]=max(dp[i-1],dp[i-2]+i*time[i]);
以此动态规划即可。

代码如下：

public:
    int deleteAndEarn(vector<int>& nums) {
         int len=nums.size();
        if(len==0) return 0;
        int total=0;
        vector<int>time(10001,0);
        vector<int>dp(10001,0);
        for(int i=0;i<len;i++){
            time[nums[i]]++;
        }
        dp[0]=0;
        dp[1]=time[1];
        for(int i=2;i<10001;i++){
            dp[i]=max(dp[i-1],dp[i-2]+i*time[i]);
        }
        return max(dp[10000],dp[9999]);
    }
};