原题地址：https://oj.leetcode.com/problems/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).

解题思路：由于可以进行无限次的交易，那么只要是递增序列，就可以进行利润的累加。

代码：

class Solution:

    # @param prices, a list of integer

    # @return an integer

    def maxProfit(self, prices):

        maxprofit = 0

        for i in range(1, len(prices)):

            if prices[i] >= prices[i-1]:

                maxprofit += prices[i] - prices[i-1]

        return maxprofit