LeetCode - DP - MaxContigiousSum

Author: harshbhardwaj

Leetcode/src/com/practise/MajorityElement.java renamed to Leetcode/src/com/practise/array_manupulation/MajorityElement.java

@@ -20,7 +20,7 @@
  */
 
 
-package com.practise;
+package com.practise.array_manupulation;
 
 public class MajorityElement {
 

Leetcode/src/com/practise/MedianNumber.java renamed to Leetcode/src/com/practise/array_manupulation/MedianNumber.java

@@ -1,4 +1,4 @@
-package com.practise;
+package com.practise.array_manupulation;
 
 public class MedianNumber {
 

Leetcode/src/com/practise/MissingNumbers.java renamed to Leetcode/src/com/practise/array_manupulation/MissingNumbers.java

@@ -1,4 +1,4 @@
-package com.practise;
+package com.practise.array_manupulation;
 /*
 Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
 

Leetcode/src/com/practise/TwoSum.java renamed to Leetcode/src/com/practise/array_manupulation/TwoSum.java

@@ -1,4 +1,4 @@
-package com.practise;
+package com.practise.array_manupulation;
 
 import java.util.HashMap;
 import java.util.Map;

Leetcode/src/com/practise/FindPalindromes.java renamed to Leetcode/src/com/practise/dynamic_programming/FindPalindromes.java

@@ -1,4 +1,4 @@
-package com.practise;
+package com.practise.dynamic_programming;
 
 import java.util.HashSet;
 import java.util.Set;

Leetcode/src/com/practise/dynamic_programming/MaxContigiousSum.java

@@ -0,0 +1,43 @@
+package com.practise.dynamic_programming;
+
+    /*
+Kadane Algorithm
+Initialize:
+        max_so_far = 0
+        max_ending_here = 0
+
+        Loop for each element of the array
+        (a) max_ending_here = max_ending_here + a[i]
+        (b) if(max_so_far < max_ending_here)
+        max_so_far = max_ending_here
+        (c) if(max_ending_here < 0)
+        max_ending_here = 0
+        return max_so_far
+
+*/
+
+    public class MaxContigiousSum {
+
+        public static int findSum(int[] arr) {
+
+            int max_so_far = arr[0];
+            int max_ending = 0;
+            for (int j : arr) {
+                max_ending = max_ending + j;
+                if (max_ending < 0) {
+                    max_ending = 0;
+                } else if (max_ending > max_so_far) {
+                    max_so_far = max_ending;
+                }
+            }
+            return max_so_far;
+        }
+
+        public static void main(String[] args) {
+            int[] arr1 = {2, -3, 4, -1, -2, 1, 5, -3};
+            int[] arr2 = {1 ,2 ,3 ,-2, 5};
+            System.out.println(MaxContigiousSum.findSum(arr1));
+            System.out.println(MaxContigiousSum.findSum(arr2));
+        }
+    }
+