class Solution {
public int maxSubArray(int[] nums) {
int sum = 0;
int max = nums[0];
for(int num:nums){
if(sum > 0){
sum += num;
}else{
sum = num;
}
max = Math.max(sum,max);
}
return max;
}
}
class Solution {
public int maxSubArray(int[] nums) {
int[] dp = new int[nums.length];
dp[0] = nums[0];
int max = dp[0];
for(int i = 1; i < nums.length;i++){
dp[i] = Math.max(nums[i],dp[i - 1] + nums[i]);
max = Math.max(dp[i],max);
}
return max;
}
}
用动态规划做