leetcode 53. 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.

click to show more practice.

easy问题 直接看代码吧

public class Solution {
    public int maxSubArray(int[] nums) {
        int max = Integer.MIN_VALUE;
        int s = 0;
        for(int i=0;i<nums.length;i++){
            if(s<0){
                s=nums[i];
            }
            else s+=nums[i];
            if(s>max)max=s;
        }
        return max;
    }
}