1: 主要思想:dp(最大和子数组) class Solution(object): def maxProfit(self, prices): """ :type prices: List[int] :rtype: int """ lenth = len(prices) if lenth == 1 or lenth == 0: return 0 newl