1423. Maximum Points You Can Obtain from Cards

Posted 2021-05-12 热带雨林

There are several cards arranged in a row, and each card has an associated number of points The points are given in the integer array cardPoints.

In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k cards.

Your score is the sum of the points of the cards you have taken.

Given the integer array cardPoints and the integer k, return the maximum score you can obtain.

 

Example 1:

Input: cardPoints = [1,2,3,4,5,6,1], k = 3
Output: 12
Explanation: After the first step, your score will always be 1. However, choosing the rightmost card first will maximize your total score. The optimal strategy is to take the three cards on the right, giving a final score of 1 + 6 + 5 = 12.

Example 2:

Input: cardPoints = [2,2,2], k = 2
Output: 4
Explanation: Regardless of which two cards you take, your score will always be 4.

Example 3:

Input: cardPoints = [9,7,7,9,7,7,9], k = 7
Output: 55
Explanation: You have to take all the cards. Your score is the sum of points of all cards.

Example 4:

Input: cardPoints = [1,1000,1], k = 1
Output: 1
Explanation: You cannot take the card in the middle. Your best score is 1. 

Example 5:

Input: cardPoints = [1,79,80,1,1,1,200,1], k = 3
Output: 202

 

Constraints:

• 1 <= cardPoints.length <= 10^5
• 1 <= cardPoints[i] <= 10^4
• 1 <= k <= cardPoints.length

class Solution {
    public int maxScore(int[] card, int k) {
        int sum = 0;
        for(int i : card) sum += i;
        int tmp = Integer.MAX_VALUE, cursum = 0;
        int n = card.length;
        int sublen = n - k;
        for(int i = 0; i < n; i++) {
            if(i < sublen) cursum += card[i];
            else {
                tmp = Math.min(tmp, cursum);
                cursum = cursum - card[i - n + k] + card[i];
            }
        }
        tmp = Math.min(tmp, cursum);
        return sum - tmp;
    }
}

逆向思维，既然是从左右两侧往里刨，那反过来想最大的sum就是整个sum减去一个中间长度为n - k的subarray，让这个sub sum最小，最后的结果就是最大。

所以问题转化为如何求出这个最小的sub array，用sliding window或者2 pointer就可以。