LIUPENG BLOG
Liupeng
Jun 7, 2020
It takes 1 minutes to read this article.

可获得的最大点数


Title

截屏2020-06-07 下午6.06.47

My Code

int Play1423::maxScore(std::vector<int> &cardPoints, int k) {
    auto sum = 0, max = 0;
    if (k >= cardPoints.size()) {
        for (auto item : cardPoints) {
            sum = sum + item;
        }
    } else {
        for (auto i = 0; i < k; i++) {
            sum = sum + cardPoints[i];
        }
        max = sum;
        auto index = 1;
        for (auto i = k-1; i >= 0; i--) {
            std::cout << cardPoints[i] << std::endl;
            sum = sum - cardPoints[i] + cardPoints[cardPoints.size()-index];
            index = index + 1;
            max = max < sum ? sum : max;
        }
        sum = max;
    }
    return sum;
}

Result

截屏2020-06-07 下午6.07.15