js求[ 1, 2, 3,-3, 2]最大连续子集和;
var arr = [1,2,3,-3,2];
function findSum(arr){
var currentSum = 0;
var maxSum = 0;
for(var i = 0;i<arr.length;i++){
if(currentSum+arr[i]>=arr[i]){
currentSum = currentSum+arr[i];
}else{
currentSum = arr[i];
}
if(currentSum>=maxSum){
maxSum=currentSum
}else{
maxSum = maxSum;
}
}
return maxSum
}
console.log(findSum(arr)) //-> 6