FilesExpand file tree

 master

/

MaxSumSubArray.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

51 lines (38 loc) · 1.19 KB

 master

/

MaxSumSubArray.java

Top

File metadata and controls

• Code
• Blame

51 lines (38 loc) · 1.19 KB

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

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

package array;

import static java.lang.Integer.max;

/**

* Created by rbhatt22 on 01/16/19.

* Problem: Find sub array with maximum sum

* Solution: Kadane's algorithm

*/

public class MaxSumSubArray {

private int[] a;

public MaxSumSubArray(int[] a) {

this.a = a;

}

private int execute () {

int local_sum = 0;

int global_sum = Integer.MIN_VALUE;

int subArrayStart = 0;

int subArrayEnd = 0;

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

local_sum = max(a[i], a[i] + local_sum);

if (local_sum >= global_sum) {

global_sum = local_sum;

if (i == subArrayEnd + 1) {

subArrayEnd++;

} else {

subArrayStart = i;

subArrayEnd = i;

}

}

}

System.out.println("Max Sub Array is starting at index:" + subArrayStart + " and ending at index:" + subArrayEnd);

return global_sum;

}

public static void main(String[] args) {

int[] a = new int[] {1, -2, -3, 2, 3, 1};

MaxSumSubArray ob = new MaxSumSubArray(a);

System.out.println(ob.execute());

}

}