【leetcode】122.（Easy）Best Time to Buy and Sell Stock II

解题思路：

迭代更新

时间复杂度：O(n)

提交代码：滑动窗口

class Solution {
    public int maxProfit(int[] prices) {
        if(prices.length==0)    return 0;
        int res=0,inPrice=prices[0];
    	for(int i=0;i<prices.length;i++) {
        	if(prices[i]<inPrice)
        		inPrice=prices[i];
        	else {
        		res+=prices[i]-inPrice;
        		inPrice=prices[i];
        	}
        }
    	return res;
    }
}

运行结果：