FilesExpand file tree

 master

/

MaximumSubarray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

26 lines (22 loc) · 656 Bytes

 master

/

MaximumSubarray.java

Copy path

Top

File metadata and controls

• Code
• Blame

26 lines (22 loc) · 656 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

/**

* Practiced on 12/9/2012

*

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

*/

package com.congli.leetcode;

public class MaximumSubarray {

public int maxSubArray(int[] array)

{

int maxSum = Integer.MIN_VALUE;

int sum = 0;

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

{

sum = Math.max(array[i], sum+array[i]);

maxSum = Math.max(sum, maxSum);

}

return maxSum;

}

}