LeetCode 122. Best Time to Buy and Sell Stock II

题目：

假设你有一个数组，其中第i个元素是某只股票在第i天的价格。设计一个算法来寻找最大的利润。您可以完成任意数量的事务(即，买进一股，再卖出一股)。必须先卖再买

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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Input: [7,1,5,3,6,4]      Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Input: [1,2,3,4,5]        Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Input: [7,6,4,3,1]        Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

思路：

只要遇到前面的价格比后面的价格低的情况，就立即卖掉

先标记数组第一个数为当前所选最小值，在遍历数组时，有以下几种情况：

1. 遇到的数比当前所选的最小值更小，更新最小值

2. 遇到的数比当前所选的最小值更大，卖掉股票，累计计算差价，并标记这个数的下一个数为下一个所选最小值

 

代码：

class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length==0) {
            return 0;
        }
    	
        int count = 0;
        int loc = prices[0];
        for(int i=1;i<prices.length;i++) {
            if(prices[i]>loc) {
                count = count + prices[i]-loc;	
            }
                loc = prices[i];
        }
        return count;
    }
}