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

  思路：

  我们可以将问题转化为一个有序数组，其中values[i]表示如果选取数字i，可以获得的最大获益。那么对于第i个数，我们就有两种决策：1）选取i，那么此时的前提条件必须是没有选取i-1，所以获益为上一次跳过i-1时的获益加上values[i]；2）跳过i，那么此时的获益就是针对i-1的决策的最大获益。如果我们用takei表示选取i时的最大获益，skipi表示跳过i时的最大获益，用take和skip分别表示上一步的两种决策所对应的两种最大收益（针对i-1），那么递推方程是：

  takei = skip + values[i]，表示我们跳过了上一个数i-1，选取了i；

  skipi = max(skip, take)，表示我们跳过了i，所以获益就是针对i-1的决策的最大获益。

  代码：

  class Solution {
  public:
      int deleteAndEarn(vector<int>& nums) {
          int n = 10001;
          vector<int> values(n, 0);
          for (int num : nums) {
              values[num] += num;
          }
          int take = 0, skip = 0;
          for (int i = 0; i < n; i++) {
              int takei = skip + values[i];   // skipped the last element, so we can take i
              int skipi = max(skip, take);    // max value of the last decision
              take = takei;
              skip = skipi;
          }
          return max(take, skip);
      }
  };