【LeetCode】 53. Maximum Subarray 最大子序和（Easy）（JAVA）
题目地址: https://leetcode.com/problems/maximum-subarray/
题目描述：
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.
Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
题目大意
给定一个整数数组 nums ，找到一个具有最大和的连续子数组（子数组最少包含一个元素），返回其最大和。
解题方法
1、不断累加直到累加值小于 0 ，从 0 重新开始
2、最大值就是累加的最大值
class Solution {
public int maxSubArray(int[] nums) {
if (nums.length <= 0) return 0;
int max = nums[0];
int cur = 0;
for (int i = 0; i < nums.length; i++) {
cur += nums[i];
if (cur > max) max = cur;
if (cur < 0) cur = 0;
}
return max;
}
}
执行用时 : 1 ms, 在所有 Java 提交中击败了 98.40% 的用户
内存消耗 : 42.1 MB, 在所有 Java 提交中击败了 6.32% 的用户
