[leetcode] Best Time to Buy and Sell Stock II

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个元素代表第i天的股票价格，现在可以进行无数次交易，但是在同一天中不能交易多次，求最大利润。

依次计算前后两天的差值作为利润，如果利润大于零，就加入到最大收益中，否则跳过。时间复杂度o(n)。

代码如下：

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