Best Time to Buy and Sell Stock -- LeetCode

原题链接: http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/ 

可以转换为求最大连续子序列和的问题。

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

                if (global < local)
                        global = local;
        }
        return global;
}
};