[LeetCode] Best Time to Buy and Sell Stock II

http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

哈哈, 状态不错, 虽然很水, 但是很快就ac了, 感觉还是很高兴~

思路就是, 找到所有递增序列, 然后最低买, 最高卖.

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int cur = 1;
        int low = 0, high = 0;
        int profit = 0;
        while (cur < prices.size()) {
            if (prices[cur] > prices[high]) {
                high = cur;
            } 
            if (prices[cur] <= prices[high] || cur == prices.size() - 1) {
                profit += prices[high] - prices[low];
                low = high = cur;
            }
            cur++;
        }
        return profit;
    }
};