leetcode

0 class Solution {

1 public:

2 int maxScore(const vector<int> &cardPoints, int k) const {

3 const int n = size(cardPoints);

4

5 int res = 0, sum = 0;

6 for (int i = 0; i < k; i++)

7 sum += cardPoints[i];

8 for (int i = n, j = k - 1; j >= 0; i--, j--) {

9 res = max(res, sum);

10 sum += cardPoints[i - 1];

11 sum -= cardPoints[j];

12 }

13

14 return max(res, sum);

15 }

16 };