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

二、思路

采用贪心算法。求最大的收益，不论你交易几次，只要求出最大收益和即可。

三、代码

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