121. Best Time to Buy and Sell Stock python

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.

解：

开始的时候想着求个最大，求个最小就可以解决，发现最小在最大右边，就有问题了；然后考虑很多都不对，可能还是编程思想不行，找不到合适的方法，后来参考了别人的方法才得以解决

从开始遍历，用当前位置的值减去之前的最小值，得到的结果看是否大于之前的存的值，就可以得到结果

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """


        if(len(prices)<=0):
            return 0
        min_num=prices[0]
        max_profit=0
        for i in range(1,len(prices)):
            min_num=min(min_num,prices[i])
            max_profit=max(max_profit,prices[i]-min_num)
        return max_profit