leetcode

0 class Solution {

1 public:

2 int deleteAndEarn(vector<int> &nums) {

3 int n = *max_element(nums.begin(), nums.end()) + 1;

4 vector<int> count(n);

5 for (int n : nums)

6 count[n] += n;

7

8 int prev1 = 0, prev2 = 0;

9 for (int i = 0; i < n; i++) {

10 int tmp = prev1;

11 prev1 = max(prev2 + count[i], prev1);

12 prev2 = tmp;

13 }

14

15 return prev1;

16 }

17 };