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

LeetCode: Maximum Subarray 解题报告相关推荐

[LeetCode] Maximum Subarray 最大子数组
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode Maximum Product Subarray 解题报告
LeetCode 新题又更新了.求:最大子数组乘积. https://oj.leetcode.com/problems/maximum-product-subarray/ 题目分析:求一个数组,连续子 ...
[LeetCode] Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
LeetCode Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
[LeetCode] Multiply Strings 解题报告
Given two numbers represented as strings, return multiplication of the numbers as a string. Note: Th ...
LeetCode - Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
LeetCode: Sort List 解题报告
Sort List Sort a linked list in O(n log n) time using constant space complexity. 使用Merge Sort, 空间复杂度 ...
Leetcode Weekly 188 解题报告
文章目录 Leetcode 1441. 用栈操作构建数组 Leetcode 1442. 形成两个异或相等数组的三元组数目 Leetcode 1443. 收集树上所有苹果的最少时间 Leetcode 1 ...
[LeetCode]Distinct Subsequences,解题报告
题目 Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequen ...

LeetCode: Maximum Subarray 解题报告

Maximum Subarray

SOLUTION 1:

LeetCode: Maximum Subarray 解题报告相关推荐

最新文章

热门文章