LeetCode 题解（80）: Best Time to Buy and Sell Stock II

题目：

Say you have an array for which the i^th 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).

题解：

想明白的话是LeetCode最简单的一道题。

给定一个数列，相邻两个数a[i],a[i-1]，只要a[i] > a[i-1]就表示一次赚钱，把所有的赚钱加起来即为结果。

c++版：

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        int gain = 0;
        for(int i = 1; i < prices.size(); i++) {
            if(prices[i] > prices[i-1]) 
                gain += prices[i] - prices[i-1];
        }
        return gain;
    }
};

Java版：

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

Python版：

class Solution:
    # @param prices, a list of integer
    # @return an integer
    def maxProfit(self, prices):
        gain = 0
        for i in range(1, len(prices)):
            if prices[i] > prices[i-1]:
                gain += prices[i] - prices[i-1]
        return gain