题目:
Given an integer array nums
, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
Follow up:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
- 求连续的数组值,相加的和最大和
- 试想一下,如果我们从头遍历这个数组。对于数组中的其中一个元素,它只有两个选择:
1. 要么加入之前的数组加和之中(跟别人一组)
2. 要么自己单立一个数组(自己单开一组)
所以对于这个元素应该如何选择,就看他能对哪个组的贡献大。如果跟别人一组,能让总加和变大,还是跟别人一组好了;如果自己起个头一组,自己的值比之前加和的值还要大,那么还是自己单开一组好了。
所以利用一个big,big表示当前这个元素是跟之前数组加和一组还是自己单立一组好,然后维护一个全局最大值即为答案。
代码如下:
public class MaximumSubarray
{
public static void main(String[] args)
{
/**
* Example:
* Input: [-2,1,-3,4,-1,2,1,-5,4],
* Output: 6
* Explanation: [4,-1,2,1] has the largest sum = 6.
*/
int[] nums = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };
System.out.println(maxSubArray(nums));
}
public static int maxSubArray(int[] nums)
{
if (nums == null || nums.length == 0)
{
return 0;
}
int local = nums[0];
int global = nums[0];
for (int i = 1; i < nums.length; i++)
{
local = Math.max(nums[i], local + nums[i]);
global = Math.max(local, global);
}
return global;
}
}