functionfindLongestConsecutiveSequence(num){
letlongNums=[]
for(letnumCount=1;numCount<=num/2+1;numCount++){
conststartNum=((2*num)/numCount-numCount+1)/2
if(startNum%1!==0||startNum===0||startNum===num){
continue
}
if(startNum<0){
break
}
longNums=[]
for(leta=0;alongNums.push(startNum+a)
}
}
returnlongNums
}
console.log(findLongestConsecutiveSequence(15))
詳情參考:一個整數(shù)分解為連續(xù)正整數(shù)之和