剑指 Offer 42. 连续子数组的最大和

package leetcode;

public class offer_42 {
    public int maxSubArray(int[] nums) {
        //记录当前所经历子数组和的最大值
        int maxnum=nums[0];
        //记录当前所经历子数组和
        int num=nums[0];
        for(int i=1;i<nums.length;i++) {
            //如果当前子数组小于0.则从下一个值开始
            if(num<0) {
                num=nums[i];
            }
            else {
                num=num+nums[i];
            }
            if(num>maxnum) {
                maxnum=num;
            }
        }
        return maxnum;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        offer_42 off=new offer_42();
        int[] nums= {-2,1,-3,4,-1,2,1,-5,4};
        System.out.println(off.maxSubArray(nums));
    }

}