思路:一维动态规划数组,每个下标值与加前和比较,去最大值
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<1)
return 0;
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];
if(arr[i]>max){
max = arr[i];
}
}
return max;
}
}