New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

求蓄水池抽样算法 #65

Open

wilbur-yu opened this issue Feb 18, 2019 · 1 comment

wilbur-yu commented Feb 18, 2019

给定一个数据流，数据流长度N很大，且N直到处理完所有数据之前都不可知，请问如何在只遍历一遍数据（O(N)）的情况下，能够随机选取出m个不重复的数据。

Owner

m9rco commented May 9, 2019

插眼，最近在做一个分布式调度的东西，等我升级下该项目，谢谢亲亲

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment