1
class Solution {
2
public:
3
int stoneGameVIII(vector<int> &stones) {
4
int prefix = 0;
5
for (auto &x : stones) prefix += x;
6

7
int ans = prefix;
8
for (int i = size(stones) - 2; i >= 1; --i) {
9
prefix -= stones[i + 1];
10
ans = max(ans, prefix - ans);
11
}
12
return ans;
13
}
14
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0