[53] Maximum Subarray

Updated on in LeetCode with 0 views and 0 comments

题目

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

解法

一

思路

遍历数组，同时计算子数组和，当和小于0时重置为0

代码

LeetCode.53.1.png


↑ ↓