子数组最大和

子数组最大和

public static int MostSumOfZixulieMethod(int[] arrays) {
		if(arrays==null || arrays.length==0) {
			return 0;
		}
		int subsum = 0;
		int maxsum = Integer.MIN_VALUE;
		for(int i=0; i<arrays.length; i++) {
			if(subsum<0) {
				subsum = arrays[i];
			}
			else{
				subsum = subsum+arrays[i];
			}
			maxsum = Math.max(subsum, maxsum);
		}
		return maxsum;
	}