LeetCode-1423-可获得的最大点数

class Solution {
    /**
     * 创建一个数组(长度为2k, 这是两端顶点能到达的最大值)用于保存用于窗口滑动的数组
     * 先将cardPoints的下标k-1->0放入数组, 再将下标length->length-k放入数组
     * 最后进行窗口滑动即可, 需判断k==length?
     * 也可以对cardPoints数组以窗口大小为length-k滑动找最小值, 然后返回total-min即可
     */
    public static int maxScore(int[] cardPoints, int k) {
        int[] points = new int[2 * k];
        int length = cardPoints.length;
        //total用于记录窗口内的数字总和
        int total = 0;
        //max用于记录滑动过程中的窗口最大值
        int max = 0;
       	//cardPoints[k-1...0]
        for (int i = k - 1; i >= 0; i--) {
            points[k - 1 - i] = cardPoints[i];
            total += cardPoints[i];
        }
        max = total;
        //cardPoints[length-1...length-1-k]
        for (int i = length - 1; i >= length - k; i--) {
            points[length + k - 1 - i] = cardPoints[i];
        }
        if (k != length) {
            for (int i = k; i < 2 * k; i++) {
                total += points[i];
                total -= points[i-k];
                max = Math.max(max, total);
            }
        }
        return max;
    }
}