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

分析

很显然，使用贪心算法时，保证当天买进后第二天涨价卖出就行；所以只要求最大的prices[i+1] - prices[i] 的和就可以了；

解答

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

    }

};