121. 买卖股票的最佳时机

class Solution {
public:
    int maxProfit(vector<int>& prices) {

        int** dp = new int*[prices.size() + 1];
        for (int i = 0; i < prices.size() + 1; ++i) {
            dp[i] = new int[2];
        }
        dp[0][0] = 0;
        dp[0][1] = INT_MIN;
        for (int i = 1; i <= prices.size(); ++i) {
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] + prices[i - 1]);

            dp[i][1] = max(dp[i - 1][1], -prices[i - 1]);
        }
        return dp[prices.size()][0];
    }
};