class Solution {
public:
int dp[100010][2];
int maxProfit(vector<int>& prices) {
//dp[i][0]: 代表第i天持有股票
//dp[i][1]:代表第i天不持有股票
dp[0][0] = -prices[0];
dp[0][1] = 0;
for(int i = 1; i < prices.size(); i++){
dp[i][0] = max(dp[i - 1][0], -prices[i]);
dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i]);
}
return dp[prices.size() - 1][1];
}
};
class Solution {
public:
const static int len = 3e4 + 10;
int dp[len][2];
int maxProfit(vector<int>& prices) {
dp[0][0] = -prices[0];
dp[0][1] = 0;
for(int i = 1; i < prices.size(); i++){
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i]);
dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i]);
}
return dp[prices.size() - 1][1];
}
};