FilesExpand file tree

 master

/

KadaneAlgorithm.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

55 lines (49 loc) · 1.29 KB

 master

/

KadaneAlgorithm.java

Top

File metadata and controls

• Code
• Blame

55 lines (49 loc) · 1.29 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

52

53

54

55

package DynamicProgramming;

import java.util.Scanner;

/**

* Program to implement Kadane’s Algorithm to

* calculate maximum contiguous subarray sum of an array

* Time Complexity: O(n)

*

* @author Nishita Aggarwal

*/

public class KadaneAlgorithm {

/**

* This method implements Kadane's Algorithm

*

* @param arr The input array

* @return The maximum contiguous subarray sum of the array

*/

static int largestContiguousSum(int arr[]) {

int i, len = arr.length, cursum = 0, maxsum = Integer.MIN_VALUE;

if (len == 0) //empty array

return 0;

for (i = 0; i < len; i++) {

cursum += arr[i];

if (cursum > maxsum) {

maxsum = cursum;

}

if (cursum <= 0) {

cursum = 0;

}

}

return maxsum;

}

/**

* Main method

*

* @param args Command line arguments

*/

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int n, arr[], i;

n = sc.nextInt();

arr = new int[n];

for (i = 0; i < n; i++) {

arr[i] = sc.nextInt();

}

int maxContSum = largestContiguousSum(arr);

System.out.println(maxContSum);

sc.close();

}

}