Lokasi ngalangkungan proxy:   [ UP ]  
[Ngawartoskeun bug]   [Panyetelan cookie]                
Skip to content

Kadane Algorithm #171

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
hash-7 wants to merge 2 commits into from
Closed

Kadane Algorithm #171

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
a063bb4
Kadane`s algorithm
hash-7 Oct 6, 2017
9383529
Rename Kadane to Kadane.java
hash-7 Oct 6, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions Dynamic Programming/Kadane.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
package kadane;
import java.util.*;
import java.io.*;
/*Find the sum of contiguous subarray within a one-dimensional array
of numbers which has the largest sum.*/
/*In this case the maximum sum will come from segment
[4,3,-1,5]*/
public class kadane {
public static void main(String args[])
{
int [] testArray={-2,4,3,-1,5,-6,-2};
System.out.println("Maximum continuous sum is "+ kadane(testArray));
}
static int kadane(int array[])
{
int size=array.length;
int maxSoFar=array[0];
int curMax=array[0];
for(int i=1;i<size;i++)
{
if(curMax+array[i]>array[i])
curMax=curMax+array[i];
else
curMax=array[i];
if(maxSoFar<curMax)
maxSoFar=curMax;
}
return maxSoFar;
}


}