leetcode-398-Random Pick Index

最新推荐文章于 2024-10-06 07:15:00 发布

zem_nezer

最新推荐文章于 2024-10-06 07:15:00 发布

阅读量107

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/zem_nezer/article/details/86701599

版权

算法专栏收录该内容

185 篇文章 0 订阅

订阅专栏

Error:
cannot done. Use a sampling call Reservoir sampling. When it meet a target, directly replace with n%, it has the same probability as the united probability.

Prove:
When we have a size n array and meet (n + 1)th element, so that this element has n / (n + 1) probability to replace the old array and 1 - n / (n + 1) probability to discard the element.

For the old element in the array, it has (1 - n / (n + 1)) + ((n / (n + 1)) * ((n - 1) / n)) = n / (n + 1)

So that the old and new element always keep the same probability for the replacement.

Or check this video