题解 | #连续子数组的最大和#
连续子数组的最大和
http://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
public class Solution {
public int FindGreatestSumOfSubArray(int[] array) {
int ans = Integer.MIN_VALUE;
int sum = 0;
sum = array[i];
}else{
sum += array[i];
}
ans = Math.max(ans,sum);
}
return ans;
}
}
public int FindGreatestSumOfSubArray(int[] array) {
int ans = Integer.MIN_VALUE;
int sum = 0;
for(int i = 0;i<array.length;i++){
//若前面的和为负数，直接将和更新为当前值
if(sum + array[i] <= array[i]){sum = array[i];
}else{
sum += array[i];
}
ans = Math.max(ans,sum);
}
return ans;
}
}
查看18道真题和解析