package com.dota;

public class Solution {
    // 1423. 可获得的最大点数
    public int maxScore(int[] cardPoints, int k) {
        int max;
        int n = cardPoints.length;
        int len = n - k;
        int sum = 0;
        for (int cardPoint : cardPoints) {
            sum += cardPoint;
        }


        int temp = 0;
        for (int i = 0; i < len; i++) {
            temp += cardPoints[i];
        }

        max = temp;
        for (int i = len; i < n; i++) {
            temp -= cardPoints[i - len];
            temp += cardPoints[i];
            if (temp < max) {
                max =temp;
            }
        }

        return sum - max;
    }
}