链接:力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
class Solution {
public:
bool stoneGame(vector<int>& piles) {
int n = piles.size();
int f[n][n];
for (int i=0;i<n;i++) {
f[i][i]=piles[i];
}
for (int i = n-1;i>=0;i--) {
for (int j=i+1;j<n;j++) {
f[i][j] = max(piles[i]-f[i+1][j],piles[j]-f[i][j-1]);
}
}
return f[0][n-1] > 0;
}
};