#1423. Maximum Points You Can Obtain from Cards

最新推荐文章于 2022-05-09 22:36:24 发布

原创最新推荐文章于 2022-05-09 22:36:24 发布 · 366 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#算法 #leetcode #c++

LeetCode 同时被 2 个专栏收录

625 篇文章

订阅专栏

算法

41 篇文章

订阅专栏

这是一个关于如何从一系列具有不同点数的卡片中选择卡片，以获得最高总分的问题。你可以在一回合中从卡片序列的开始或结束处取一张卡片，总共需要取k张卡片。给定卡片点数数组和要取的卡片数k，目标是找到最大可能得分。例子展示了不同的取卡策略和对应的得分。问题约束包括数组长度和卡片点数的范围。

题目描述：

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(vector<int>& cardPoints, int k) {
        int n = cardPoints.size();
        // 空出首尾的前后缀之和更简便
        vector<int> prefix_sum(n + 1, 0);
        vector<int> surfix_sum(n + 1, 0);
        for (int i = 1; i < n; i++) {
            prefix_sum[i] = prefix_sum[i - 1] + cardPoints[i - 1];
        }
        for (int i = n - 1; i >= 0; i--) {
            surfix_sum[i] = surfix_sum[i + 1] + cardPoints[i];
        }
        int max_sum = 0;
        for (int i = 0; i <= k; i++) {
            max_sum = max(max_sum, prefix_sum[i] + surfix_sum[n + i - k]);
        }
        return max_sum;
    }
};