小白笔记-----------------------------leetcode53. Maximum Subarray

public class Solution {    public int maxSubArray(int[] nums) {        int count = 0;        int max = nums[0];        for(int i = 0;i < nums.length;i++){            count = nums[i];            if(count > max){                    max = count;            }            for(int j = i+1;j < nums.length;j++){                count +=  nums[j];                if(count > max){                    max = count;                }                            }                     }        return max;    }}

简单的双重游标的思想就ok了