例子:312758694v1.0.0从前到后循环寻找所有可能constarr=[3,1,2,7,5,8,6,9,4]for(leti=0;i>1//相当于Math.floor((start+end)/2)if(arr[min_arr[middle]]arrI){min_arr[end]=iif(end>0){prev_arr[i]=min_arr[end-1]//前一个索引}}}//来自Find最后一项转发letresult=[]leti=min_arr.lengthletlast=min_arr[i-1]while(i-->0){result[i]=lastlast=prev_arr[last]}returnresult}console.log(getSequence([3,1,2,7,5,8,6,9,4]))//索引:[1,2,4,6,7]//值:[1,2,5,6,9]