Maximum Subarray with Sum/ Multiply

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.

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

View Code

What if multiply?

转载于:https://www.cnblogs.com/krunning/p/3538732.html

Maximum Subarray with Sum/ Multiply相关推荐

Lintcode42 Maximum Subarray II solution 题解
[题目描述] Given an array of integers, find two non-overlapping subarrays which have the largest sum.The ...
[LintCode] Maximum Subarray 最大子数组
Given an array of integers, find a contiguous subarray which has the largest sum. Notice The subarra ...
[LeetCode] Maximum Subarray 最大子数组
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
[Lintcode]41. Maximum Subarray/[Leetcode]53. Maximum Subarray
41. Maximum Subarray/53. Maximum Subarray 本题难度: Eas Topic: Dynamic Programming Description Given an ...
Leetcode-53 Maximum Subarray
#53. Maximum Subarray Find the contiguous subarray within an array (containing at least one number ...
53.Maximum Subarray
/** 53.Maximum Subarray * 2016-5-7 by Mingyang * 如果我们从头遍历这个数组.对于数组中的其中一个元素,它只有两个选择: 1.* 要么加入之前的数组加和之 ...
LeetCode(53):Maximum Subarray
Maximum Subarray: Find the contiguous subarray within an array (containing at least one number) whic ...
【LeetCode】053. Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
LeetCode: Maximum Subarray 解题报告
Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which ...

Maximum Subarray with Sum/ Multiply

Maximum Subarray with Sum/ Multiply相关推荐

最新文章

热门文章