Leetcode 53. Maximum Subarray (Medium) (java)

Leetcode 53. Maximum Subarray (Medium) (java)

Tag: Array, Divide and Conquer, Dynamic Programming

Difficulty: Medium

/*

53. Maximum Subarray (Medium)

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

click to show more practice.

More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

*/
public class Solution {
	public int maxSubArray(int[] nums) {
		int _sum = Integer.MIN_VALUE, prev = 0;
		for (int i = 0; i < nums.length; i++) {
			prev = Math.max(prev + nums[i], nums[i]);
			_sum = Math.max(_sum, prev);
		}
		return _sum;
	}
};