leetcode121题

121题和122题类似，但121题是只能买卖一次股票

代码如下：
class Solution(object):
def maxProfit(self, prices):
“”"
:type prices: List[int]
:rtype: int
“”"
if (prices == None) or len(prices) == 0:
return 0
# 初始定位从prices[0]买入股票
Min = prices[0]
res = 0# 利润初始化为0
for i in prices:
res = max(res, i - Min)
Min = min(Min, i)
return res

prices = [7,1,5,3,6,4]
a = Solution()
b = a.maxProfit(prices)
print(b)