题目:
解决:动规
public int maxsumofSubarray (int[] arr) {
// write code here
if(arr.length<1)
return -1;
int max = arr[0];
for(int i =1;i<arr.length;i++){
arr[i] = arr[i]>arr[i]+arr[i-1]?arr[i]:arr[i]+arr[i-1];
max = Math.max(max,arr[i]);
}
return max;
}