solution_740

最新推荐文章于 2021-08-19 15:55:42 发布

哲学加农炮

最新推荐文章于 2021-08-19 15:55:42 发布

阅读量116

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_40132934/article/details/78948418

版权

LeetCode 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

LeetCode Problem 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.

Note:

The length of nums is at most 20000.

Each element nums[i] is an integer in the range [1, 10000].

Solution

In this problem, I will calculate the sums of the same numbers and store them in a new map object with the numbers as keys and the sums as values. Then I can use the dynamic programming to get the best solution we want. The code is as following:

typedef pair<int, int> combine;

class Solution {
public:
    int deleteAndEarn(vector<int> & nums) {
        map<int, int> myMap;
        int leng = nums.size();
        int previous = 0, current = 0, preElement = -1, temp = 0;
        //Get the sums of the same numbers
        for (int i = 0; i < leng; i++) {
            if (myMap.find(nums[i]) ==  myMap.end()) {
                myMap.insert(combine(nums[i], nums[i]));
            }
            else {
                myMap.find(nums[i])->second += nums[i];
            }
        }
        //Get the best solution
        for (map<int, int>::iterator i = myMap.begin(); i != myMap.end(); i++) {
            //If the current element is next to the last element of the queue we select
            //Then we should compare the current queue and the previous queue with 
            //current element
            if(preElement == i->first - 1) {
                temp = max(previous + i->second, current);
                preElement = ((previous + i->second) <= current) ? preElement : i->first;
                previous = current;
                current = temp;
            }
            //If not, then we can just simply add it to our queue
            else {
                previous = current;
                preElement = i->first;
                current = current + i->second;
            }
        }
        return current;
    }
};

Note that with the method we take, we can make sure that the value of the current queue we get so far must be the maximum one. So in this way we can get the solution we want.