LeetCode_53:最大子数组和：Java

package LeetCode.contact;

class Solution_53 {
    public int maxSubArray(int[] nums) {
        int ans = nums[0];
        int sum = 0;
        //当数组长度为1直接输出
    	while(nums.length == 1){return ans;}	
    	
//    	遍历nums中的数，赋值给num
        for(int num: nums) { 		 
            if(sum > 0) {
                sum += num;
            } else {
                sum = num;
            }
            ans = Math.max(ans, sum);
        }
        return ans;

    }
}

public class leetcode_53 {
	public static void main(String[] args){
		Solution_53 sol = new Solution_53();
		int[] arr = new int[]{1,2,-1,-2,2,1,-2,1};
		int a = sol.maxSubArray(arr);
		System.out.println(a);
		
	}
}