import java.util.*; public class Solution { /** * max sum of the subarray * @param arr int整型一维数组 the array * @return int整型 */ public int maxsumofSubarray (int[] arr) { // write code here if(arr.length == 0){ return 0; } if(arr.length == 1){ return arr[0]; } int max = arr[0]; int cur = arr[0]; for(int i = 1;i<arr.length;i++){ int next = arr[i]; if(cur <= 0){ //帮不了忙 要他干啥 cur = next; } else { cur += next; } max = Math.max(max,cur); } return max; } }