740. Delete and Earn

https://leetcode.com/problems/delete-and-earn/description/

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.

解题思路：
当选取一个数时需要将它所有出现的数都选上，可以将它所出现的数放在数组的某一个位置(求和)
最优子结构
对于每个桶有取或者不取两种情况
状态转移方程

    take[i]=untake[i-1]+values[i]
    untake[i]=max(take[i-1],untake[i-1])

边界

     take[0]=0;
     untake[0]=0;

public class Delete_an_Earn_740 {

    /**
     * 当选取一个数时需要将它所有出现的数都选上，可以将它所出现的数放在数组的某一个位置(求和)
     * 最优子结构
     * 对于每个桶有取或者不取两种情况
     * 状态转移方程
     * take[i]=untake[i-1]+values[i]
     * untake[i]=max(take[i-1],untake[i-1])
     * 边界
     * take[0]=0;
     * untake[0]=0;
     * @param nums
     * @return
     */
    public int deleteAndEarn(int[] nums) {
        int[] values = new int[10001];
        int[] take = new int[10001];
        int[] untake = new int[10001];
        for(int num:nums){
            values[num]+=num;
        }
        take[0]=0;
        untake[0]=0;
        for(int i=1;i<10001;i++){
            take[i]=untake[i-1]+values[i];
            untake[i]=Math.max(take[i-1],untake[i-1]);
        }
        return Math.max(take[10000], untake[10000]);
    }

    public static void main(String[] args) {
        new Delete_an_Earn_740().deleteAndEarn(new int[]{2, 2, 3, 3, 3, 4});
    }

}