Largest Sum Contiguous Subarray - Kadene's algorithm
I have some suggestions for your code.
Replace the for loop with an enhanced 'for' loop
In your code, you don’t actually need the index provided by the loop, you can use the enhanced version.
before
for (int i = 0; i &lt; a.length; i++) {
//[...]
}

after
for (int current : a) {
//[...]
}

Variable and parameter name should be in camelCase style
The variables should be in camelCase.