Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

SOLUTION 1:

采用滑动窗口解决。sum 如果小于0，置为0，再加上当前值。

然后再与max相比，取大的。 1分钟AC

 1 public class Solution {
 2     public int maxSubArray(int[] A) {
 3         if (A == null || A.length == 0) {
 4             return 0;
 5         }
 6         
 7         int max = Integer.MIN_VALUE;
 8         int sum = 0;
 9         
10         int len = A.length;
11         for (int i = 0; i < len; i++) {
12             if (sum < 0) {
13                 sum = 0;
14             }
15             
16             sum += A[i];
17             max = Math.max(max, sum);
18         }
19         
20         return max;
21     }
22 }

View Code

https://github.com/yuzhangcmu/LeetCode_algorithm/blob/master/array/MaxSubArray_1220_2014.java

免责声明！

本站转载的文章为个人学习借鉴使用，本站对版权不负任何法律责任。如果侵犯了您的隐私权益，请联系本站邮箱yoyou2525@163.com删除。

猜您在找 Maximum Subarray leetcode java [leetcode]Maximum Subarray @ Python LeetCode: Binary Tree Maximum Path Sum 解题报告 Lintcode: Subarray Sum 解题报告 leetCode 53.Maximum Subarray (子数组的最大和) 解题思路方法 Leetcode#53 Maximum Subarray [leetcode]Maximum Product Subarray @ Python 【LeetCode】152. Maximum Product Subarray [LeetCode 1186] Maximum Subarray Sum with One Deletion Leetcode: Maximum Size Subarray Sum Equals k