Best Time to Buy and Sell Stock II

Say you have an array for which theithelement is the price of a given stock on dayi.

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

只要prices[i] > prices[i-1]]，我们就在第i-1天买入，第i天抛出。这样可以包括所有可能赚取利润的区间

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """

        result = 0
        for i in xrange(1, len(prices)):
            if prices[i] - prices[i-1] >0:
                result += prices[i] - prices[i-1]
        return result