【LeetCode算法-53】Maximum Subarray

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];
        int length = nums.length;
        for(int i = 1;i<=length;i++){
            int once = getOnce(nums,i);
            if(once>sum){
                sum = once;
            }
        }
        return sum;
    }
    
    public int getOnce(int[] nums,int n){
        int max = nums[0];
        for(int i = 0;i<=(nums.length-n);i++){
            int add = 0;
            int nn = n;
            while(--nn >= 0){
                add+=nums[i+nn];
            }
            if(add > max){
                max = add;
            }
        }
        return max;
    }
}

class Solution {
    public int maxSubArray(int[] nums) {
        int sum = nums[0];
        int max = nums[0];
  
         for (int i = 1; i < nums.length; i++) {
             System.out.print("当前值:"+nums[i]+"--当前值+前面的最大和:"+(sum + nums[i]));
             sum = Math.max(nums[i], sum + nums[i]);
             System.out.println("当前的最大和:"+sum);
             max = Math.max(max, sum);
         }
         return max;
    }
}