标签：max mos stp python leetcode ram div pre return
class Solution:
# @param {integer[]} prices
# @return {integer}
def maxProfit(self, prices):
if len(prices) <= 1: return 0
low = prices[0]; mostProfit = 0
for i in range(1, len(prices)):
if prices[i] < low: low = prices[i]
mostProfit = max(mostProfit, prices[i] - low)
return mostProfit
Leetcode 121 Best Time to Buy and Sell Stock
标签：max mos stp python leetcode ram div pre return
原文地址：http://www.cnblogs.com/wgwyanfs/p/6770604.html
