122.leetcode Best Time to Buy and Sell Stock II(medium)[贪心算法 数组]

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

具体思路：这个题目的含义是可以多次交易，但是在同一时刻只能持有一个股票，只有当当前的股票卖掉才能买新的股票。因此采用贪心策略肯定是交易次数越多越好，但是什么时候开始另一次交易，就在买了一个股票之后一直递增的序列直到递减，又开始一个新的序列，这样得到的利益将是最大的。例如:2 3 1 5 6 9 2 那么最大的利益就是2-3和1-9段

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        //根据观察要使最后的利益最大就是将序列中的连续递增段的差值求和
        int result = 0;
        int n = prices.size();
        if(n<=1) return result;
        int start = prices[0];
        int ends = prices[0];
        for(int i=1;i<n;i++)
        {
            if(prices[i]>= ends)
                ends = prices[i];
            else //另一个递增序列开始
            {
                result += ends-start;
                start = prices[i];
                ends = prices[i];
            }
        }
        result += ends-start;
        return result;
    }
};