题解 | #买卖股票的最好时机(一)#

class Solution { public: /** * * @param prices int整型vector * @return int整型 */ int dp[10005][2]; int maxProfit(vector& prices) { // write code here

    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][1], - prices[i]);
    }
    int my_ans = -2e9;
    for(int i = 0; i < prices.size(); i ++ )
    {
        my_ans = max(my_ans, dp[i][0]);
        my_ans = max(my_ans, dp[i][1]);
    }
    if(my_ans < 0) return 0;
    return my_ans;
}

};