FilesExpand file tree

 master

/

MaximumSubarray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

28 lines (28 loc) · 753 Bytes

 master

/

MaximumSubarray.java

Copy path

Top

File metadata and controls

• Code
• Blame

28 lines (28 loc) · 753 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

/**

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

* largest sum.

*

* <p>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.

*

* <p>click to show more practice.

*

* <p>More practice: If you have figured out the O(n) solution, try coding another solution using

* the divide and conquer approach, which is more subtle.

*/

public class MaximumSubarray {

public int maxSubArray(int[] A) {

int max = Integer.MIN_VALUE;

int sum = 0;

for (int i = 0; i < A.length; i++) {

sum += A[i];

if (sum > max) {

max = sum;

}

if (sum < 0) {

sum = 0;

}

}

return max;

}

}