该问题要求设计一个算法，从[0, n - 1]中随机选择不在黑名单blacklist内的数字，确保每个可用数字的概率相等。通过建立映射，将黑名单中[0, n-m-1]的数字与[n-m, n-1]的可选数字对应，可以实现一次随机选取并减少对内置随机函数的调用次数。"
80222463,2973597,Eureka服务注册与安全验证配置详解,"['微服务', 'Spring Cloud', 'Eureka Server', '服务治理', '安全']
You are given an integer n and an array of unique integers blacklist. Design an algorithm to pick a random integer in the range [0, n - 1] that is not in blacklist. Any integer that is in the mentioned range and not in blacklist should be equally likely to be returned.
Optimize your algorithm such that it minimizes the number of calls to the built-in random function of your language.
Implement the Solution class:
Solution(int n, int[] blacklist)Initializes the object with the integernand the blacklisted integersblacklist.int pick()Returns a random integer in the range[0, n - 1]and not inblacklist.
Example 1:
Input ["Solution", "pick", "pick&
最低0.47元/天 解锁文章
901
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
