snippets
filter:96 snippets
java-lc-maxsubarray·java·leetcode
public int maxSubArray(int[] nums) {
int best = nums[0], curr = nums[0];
for (int i = 1; i < nums.length; i++) {
curr = Math.max(nums[i], curr + nums[i]);
best = Math.max(best, curr);
}
return best;
}
java-lc-maxsubarray·java·leetcode
public int maxSubArray(int[] nums) {
int best = nums[0], curr = nums[0];
for (int i = 1; i < nums.length; i++) {
curr = Math.max(nums[i], curr + nums[i]);
best = Math.max(best, curr);
}
return best;
}