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).

股票可以买卖多次，如果第一天股价为1  第二天为3  第三天为8

第一天买第三天卖：8-1=7

第一天买第二天卖 加上  第二天买第三天卖 ：（3-1）+（8-3）=7

只有知道明天的股价会高于今天的，就可以买

class Solution {public:    int maxProfit(vector<int> &prices) {        int profit=0;        if(prices.size()<2)            return 0;        for(int i=1;i<prices.size();i++)        {            if(prices[i]-prices[i-1]>0)                profit+=(prices[i]-prices[i-1]);        }        return profit;    }};