javascript 给定总和的子阵列

Posted 2021-05-03

function missingNum(n, sum, arr) {
  
  var startIndex = 1;
  var endIndex = 1;
  var tempSum = 0;
  for(var i=0; i<arr.length; i++) {
    tempSum += arr[i];
    //console.log(tempSum);
    if(tempSum > sum) {
      //console.log(startIndex);
      i = startIndex-1;
      startIndex++;
      tempSum = 0;
      
    }
    if(tempSum === sum) {
      endIndex = i+1;
      break;
    }
  }
  console.log(startIndex);
  console.log(endIndex);
  
}

missingNum(4, 7, [4,2,3,5,1,3,4,6]);