題目在這:https://leetcode-cn.com/problems/maximum-subarray/
法一:
nums = [-10086]
res = nums[0]
for i in range(len(nums)):
temp = 0
for j in range(i,len(nums)):
temp += nums[j]
if temp > res:
res = temp
print(res) 題目在這:https://leetcode-cn.com/problems/maximum-subarray/
nums = [-10086]
res = nums[0]
for i in range(len(nums)):
temp = 0
for j in range(i,len(nums)):
temp += nums[j]
if temp > res:
res = temp
print(res) ![筆試面試題目：滑動視窗(二)[圖]](data:image/gif;base64,R0lGODlhAQABAIAAAP///wAAACwAAAAAAQABAAACAkQBADs=)