LeetCode: Best Time to Buy and Sell Stock II

少数次修改吧，忘了加最后一个递增曲线了

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (prices.size() <= 1) return 0;
        int minprice = prices[0];
        int maxprofit = 0;
        for (int i = 1; i < prices.size(); i++) {
            if (prices[i] > prices[i-1]) continue;
            else {
                maxprofit += prices[i-1] - minprice;
                minprice = prices[i];
            }
        }
        if (prices[prices.size()-1] >= prices[prices.size()-2])
            maxprofit += prices[prices.size()-1] - minprice;
        return maxprofit;
    }
};

java

public class Solution {
    public int maxProfit(int[] prices) {
        int ans = 0;
        if (prices.length < 2) return ans;
        for (int i = 1; i < prices.length; i++)
        {
            ans += Math.max(0, prices[i] - prices[i-1]);
        }
        return ans;
    }
}