LeetCode---Best Time to Buy and Sell Stock I和II

121. Best Time to Buy and Sell Stock

Say you have an array for which the ith element is the price of a given stock on day i.

If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

Note that you cannot sell a stock before you buy one.

Example 1:

Input: [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
             Not 7-1 = 6, as selling price needs to be larger than buying price.

Example 2:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

数组i的位置代表第i天股票的价格，只允许买一次，卖一次，买卖不可以在同一天，求最大利润。

思路：遍历一次，假设第一个位置是最小值，不断迭代更新最小值，并计算最小值与最新遍历点的差值，最大的即为最大交易

class Solution:
    def maxProfit(self, prices):
        maxprofit = 0
        if len(prices)==0:
            return maxprofit
        lowprice=prices[0]
        for i in range(1,len(prices)):
            if prices[i]<lowprice:
                lowprice=prices[i]
            else:
                profit=prices[i]-lowprice
                if profit>maxprofit:
                    maxprofit=profit
        return maxprofit

122. 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

本题和上一题的不同之处在于，无论买多少次都可以，不过必须卖出这一股之后才可以买新的，求所有最大的收益

思路：每当价格上涨就卖掉

class Solution:
    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