leetcode-122-买卖股票的最佳时机II
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() == 0) return NULL;
vector<int> status(2);
vector<vector<int>> dp(prices.size(), status);
dp[0][0] = 0;
dp[0][1] = -prices[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][0] - prices[i], dp[i - 1][1]);
}
return dp[prices.size() - 1][0];
}
};