leetcode怎么解决马戏团人塔问题

func bestSeqAtIndex(height []int, weight []int) int {    if len(weight)<1{    return 0  }  for i:=0;i      for j:=i;j          if height[i]>height[j]{              height[i],height[j]=height[j],height[i]              weight[i],weight[j]=weight[j],weight[i]          }      }  }  for i:=0;i      j:=1      for i+j          j++      }      weight=sort(weight,i,j)      i+=j   }  var dp []int  dp=append(dp,weight[0])  for i:=1;i      if weight[i]>dp[len(dp)-1]{          dp=append(dp,weight[i])      }else{          l:=0          r:=len(dp)-1          p:=0          for l<=r{              mid:=(l+r)>>1              if weight[i]>dp[mid]{                 p=mid+1                 l=mid+1              }else{                  r=mid-1              }          }          dp[p]=weight[i]      }  }  fmt.Println(dp)  return len(dp)}
func sort(a []int,s,e int)[]int{    for i:=s;i<=e;i++{        for j:=i;j            if a[i]                a[i],a[j]=a[j],a[i]            }        }    }    return a}