连续子数组的最大和

function getMaxSubarr(arr){  if(Array.isArray(arr) || Object.propotype.toString.call(arr) === '[object Array]'){    var start=0,end,temptStart,temptEnd,temptSum=0,maxSum=0;    length = arr.length;    for(var i=0; i<length; i++){        if(temptSum<=0){            temptStart = i;            temptSum = arr[i];        }else{            temptSum += arr[i];            temptEnd = i;            if(temptSum>maxSum){                maxSum = temptSum;                start = temptStart;                end = temptEnd;            }        }    }    return {        arr:arr.slice(start,end+1),        sum:maxSum    }  }}console.log(getMaxSubarr([1,-2,3,10,-4,7,2,-5]));