Maximum Points You Can Obtain from Cards LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxScore(vector<int> &cardPoints, int k) {
4
    int max_s = 0, left = 0, right = 0, n = cardPoints.size();
5

6
    // getting sum of k right elements
7
    for (int i = 0; i < k; i++) {
8
      right += cardPoints[n - i - 1];
9
    }
10

11
    // Assumming max as sum of k right elements
12
    max_s = right;
13
    for (int i = 0; i < k; i++) {
14
      left += cardPoints[i];
15
      right -= cardPoints[n - k + i];
16
      max_s = max(max_s, left + right);
17
    }
18
    return max_s;
19
  }
20
};