Title: Maximum Subarray Source: leetcode.com
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.
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.
Java solution
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
/* https://leetcode.com/problems/maximum-subarray/ */ class MaximumSubarray { public static void main(String args[]) { MaximumSubarray ms = new MaximumSubarray(); //int nums[] = {-2, 1, -3, 4, -1, 2, 1, -5, 4}; int nums[] = {-2, -1}; System.out.println(ms.maxSubArray(nums)); } public int maxSubArray(int[] nums) { int[] dp = new int[nums.length]; dp[0] = nums[0]; int max = dp[0]; for(int i=1;i<nums.length;i++) { dp[i] = Math.max(dp[i-1]+nums[i], nums[i]); //dp[i] = dp[i]<0?0:dp[i]; max = Math.max(dp[i], max); } return max; } } |