Max subarray sum (Kadane)
Java
Hard
4 views
Problem Description
Task: return maximum subarray sum (at least one element).
Output Format
Return value
Constraints
Array length >= 1.
Official Solution
static long maxSubarray(int[] a){long best=a[0],cur=a[0];for(int i=1;i<a.length;i++){cur=Math.max(a[i],cur+a[i]);best=Math.max(best,cur);}return best;}
Solutions (0)
No solutions submitted yet. Be the first!
No comments yet. Start the discussion!