Like the N-convex algorithm, this algorithm attempts to find a set of candidates whose centroid is close to . The key difference is that instead of taking unique candidates, we allow candidates to populate the set multiple times. The result is that the weight of each candidate is simply given by its frequency in the list, which we can then index by random selection:
sequenceDiagram。旺商聊官方下载对此有专业解读
* 核心思路：单调递减栈（找「上一个比当前价格大的元素索引」），时间复杂度O(n)，空间复杂度O(n)。51吃瓜对此有专业解读
对于 Protobuf 的介绍和原理，可以参考前文 juejin.cn/post/757536…，这一点在im钱包官方下载中也有详细论述