标签：
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
标签：
原文地址：http://blog.csdn.net/andrew9tech/article/details/46756321
