'''
Description: 
Autor: Au3C2
Date: 2021-02-06 21:05:11
LastEditors: Au3C2
LastEditTime: 2021-02-06 21:05:44
'''
class Solution:
    def maxScore(self, cardPoints: List[int], k: int) -> int:
        if k >= len(cardPoints):
            return sum(cardPoints)
        max_points = now_points = sum(cardPoints[:k])
        for i in range(k):
            now_points = now_points - cardPoints[k-i-1] + cardPoints[-1-i]
            max_points = max(max_points,now_points)
        return max_points
# 滑窗，每日一题，还是做过的
# https://leetcode-cn.com/problems/maximum-points-you-can-obtain-from-cards/