【Leetcode】122. Best Time to Buy and Sell Stock II（Easy）

1.题目

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

翻译：已知一支股票在第i天的价钱，设计一个算法找到最大收益。你可以交易任意多次只要你喜欢（例如，多次买卖一股股票）。但是，你不能重复买入。（例，假如你想再买一支，必须卖掉上一支。）

2.思路

假如共存在0天或1天，则总收益为0。其他的情况，for循环判断，当某一天的价格高于前一天时，即可获益，新总收益=原总收益+这两天的差值。

3.算法（Accepted）

class Solution {
    public int maxProfit(int[] prices) {
        int length=prices.length;
        if(length==0||length==1)
            return 0;
        
        int count =0;
        for(int i=1;i<=length-1;i++){
            if(prices[i]>=prices[i-1]){
                count+=prices[i]-prices[i-1];
            }
        }
        
        return count;
    }
}