leetcood學習筆記-53*-最大子列和

題目描述：   方法一：O(N) class Solution(object): def maxSubArray(self, nums): sum = 0 max_sub_sum = nums[0] for num in nums: sum += num if sum > max_sub_sum

>>阅读原文<<