题解 | #子数组的最大累加和问题#
子数组的最大累加和问题
http://www.nowcoder.com/practice/554aa508dd5d4fefbf0f86e5fe953abd
dp[i] = max(0,dp[i-1])+arr[i];
import java.util.*;
public class Solution {
public int maxsumofSubarray (int[] arr) {
// write code here
int[] dp = new int[arr.length];
int max = arr[0];
dp[0] = arr[0];
for(int i=1; i<arr.length; i++){
dp[i] = Math.max(0,dp[i-1])+arr[i];
max = Math.max(dp[i],max);
}
return max;
}
}
百度二面460人在聊
