398. Random Pick Index
来源:互联网 发布:木马什么意思网络用语 编辑:程序博客网 时间:2024/05/11 19:07
Given an array of integers with possible duplicates, randomly output the index of a given target number. You can assume that the given target number must exist in the array.
Note:
The array size can be very large. Solution that uses too much extra space will not pass the judge.
Example:
int[] nums = new int[] {1,2,3,3,3};Solution solution = new Solution(nums);// pick(3) should return either index 2, 3, or 4 randomly. Each index should have equal probability of returning.solution.pick(3);// pick(1) should return 0. Since in the array only nums[0] is equal to 1.solution.pick(1);
这类题目都类似,最关键的是理解
if (rnd.nextInt(++count) == 0) result = i;
这一段为什么等于从所有的target里随意的取一个
public class Solution { int[] nums; Random rnd; public Solution(int[] nums) { this.nums = nums; this.rnd = new Random(); } public int pick(int target) { int result = -1; int count = 0; for (int i = 0; i < nums.length; i++) { if (nums[i] != target) continue; if (rnd.nextInt(++count) == 0) result = i; } return result; }}
0 0
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index**
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 【Leetcode】398. Random Pick Index
- Leetcode 398. Random Pick Index
- [LeetCode] 398. Random Pick Index
- LeetCode 398. Random Pick Index
- [Leetcode]398. Random Pick Index
- 【Leetcode】398. Random Pick Index
- 【LeetCode】 398. Random Pick Index
- 398. Random Pick Index (M)
- LeetCode 398. Random Pick Index
- Maven导入本地jar包
- 单元测试 使用场景
- 顺序表应用3:元素位置互换之移位算法
- (poj3280)区间dp训练
- 微信小程序框架集合
- 398. Random Pick Index
- CodeForces 754A
- 关于springmvc4.3.5的配置
- js函数的重载
- maven-assembly-plugin 打包可执行jar(fat jar)和配置文件与jar同时打包部署
- 476. Number Complement*
- 【bzoj3994】[SDOI2015]约数个数和
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- JSTL 和 EL 的简单理解篇