leetcode之Best Time to Buy and Sell Stock

class Solution(object):
def maxProfit(self, prices):
"""
:type prices: List[int]
:rtype: int
"""
if len(prices) <= 1:
return 0
list1 = []
for i in range(len(prices) - 1):
list1.append(prices[i + 1] - prices[i])
if len(list1) == 1:
return [list1[0], 0][list1[0] < 0]
for i in range(1, len(list1)):
list1[i] = max(list1[i], list1[i] + list1[i - 1])
return [max(list1), 0][max(list1) < 0]