leetcode(18)-----Best Time to Buy and Sell Stock

121. 买卖股票的最佳时机
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.

---

Python代码实现：
1.暴力穷举
一些有时间限制的可能实现不了

class Solution:
    def maxProfit(self, prices):
        maxpro = 0
        for i in range(0, len(prices)):
            min = prices[i]
            for i in range(i+1, len(prices)):
                pro = prices[i] - min
                if pro > maxpro:
                    maxpro = pro
        return maxpro

2.分治法
先把最大差值设为0，第一个数设为最小数，然后遍历下一个数是否比最小数小，如果是就将最小数替换更新，如果不是，再判断这个数减去之前的最小数之后 是否大于最大差值，如果是就将最大差值替换更新掉，如果不是就开始判断下一个数，如此循环下去，找到最大差值。

class Solution:
    def maxProfit(self, prices):
        if prices ==None or len(prices)==0:
            return 0
        maxpro = 0
        min = prices[0]
        for i in range(1, len(prices)):
            if min > prices[i]:
                min = prices[i]
            elif prices[i] - min > maxpro:
                maxpro = prices[i] - min
        return maxpro

---

121. 买卖股票的最佳时机 ||