Best Time to Buy and Sell Stock II

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

解题思路：首先这道题有一个限定条件，就是在买入股票之前要确保手头上没有股票，也就是说除了第一次买入股票以外，其他的在买入之前必须先卖出。至于要怎么才能获得最大利润，这就涉及到了怎么买和怎么卖的问题。用贪心算法来考虑的话就是每次以最低价买入，然后以最高价卖出，获得的差额就是最大的。但是只这样考虑还不行，还要确保尽可能多的交易次数。现在来考虑这一种情况：股票的价格是递增的，a，b，c，d为四天的价格，那么利润最大就是d-a，虽然只交易了一次，但利润确实最大的，因为如果交易了两次，那么利润就是（b-a）+（d-c）= d-a+（b-c）

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int profit = 0;
        int size = prices.size();
        int next = 1; //下一个价格的下标
        int cur = 0;  //当前价格的下标
        int beg = 0;  //序列的起点
        while (next < size) {
            for (; cur < size - 1; cur++) {
                if (prices[next] < prices[cur]) //找出破坏递增关系的下标 
                    break;
                else 
                    next = next + 1;
            } 
            profit = profit + prices[cur] - prices[beg];
            if (cur < size - 1) 
                cur = cur + 1;
            beg = next;
            next = next + 1;
        }
        return profit;
    }
};