#LeetCode 上第 121 号问题：股票买卖(一次交易获得最大利润)

class Solution:
    def maxProfit(self, prices):
        max_x,min_x = 0,99999
        for i in range(len(prices)):
            min_x = min(min_x,prices[i])
            max_x = max(max_x,prices[i]-min_x)
        return max_x
s = Solution();
print(s.maxProfit([7,1,5,3,6,4]))