[leetcode]Best Time to Buy and Sell Stock II @ Python

原題住所: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