Maximum Subarray

题目： Maximum Subarray

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.

题意;最大子序列求和，给定一个数组，求出所有子序列中和的最大值

方法一：二个for循环遍历所有子序列

方法二：可以先设定一个最大值max,sum每次求和后和0比较，小于0就把sum重置为0

public int maxSubArray(int[] nums) {
int max = Integer.MIN_VALUE;
int sum = 0;
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
max = Integer.max(sum, max);
sum = Math.max(sum, 0);


}
return max;

}