leetcode 53:Maximum Subarray

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.

class Solution {
    public int maxSubArray(int[] nums) {
        int sum=nums[0],b=0;
        for(int x:nums){
            if(b<0)
                b=x;
            else
                b+=x;
            sum=b>sum?b:sum;
        }
        return sum;
    }
}

打算开始学Java，先挑一道easy的题练练吧。