动态规划+不要开辟新的dp[i]
子数组的最大累加和问题
http://www.nowcoder.com/questionTerminal/554aa508dd5d4fefbf0f86e5fe953abd
public class Solution {
public int maxsumofSubarray (int[] arr) {
int max=arr[0];
for(int i=1;i<arr.length;i++){
arr[i]=arr[i-1]>0?arr[i]+arr[i-1]:arr[i];
max=Math.max(max,arr[i]);
}
return max;
}
}