sicily 1005. 最大和(week 20)

动态规划

class Solution {
public:
int maxSum(vector<int>& A) {
int dp[100005];
dp[0] = A[0];
for(int i = 1; i < A.size(); i += 1) {
dp[i] = 0;
if(i==1) {
dp[1] = A[0] > A[1] ? A[0] : A[1];
}
else {
if(dp[i-1] > dp[i-2] + A[i]) {
dp[i] = dp[i-1];
} else {
dp[i] = dp[i-2] + A[i];
}
}

}
return dp[A.size()-1];
}
};