-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRandomPickIndex.java
More file actions
49 lines (45 loc) · 1.39 KB
/
RandomPickIndex.java
File metadata and controls
49 lines (45 loc) · 1.39 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
package medium;
import java.util.Random;
/**
* ClassName: RandomPickIndex.java
* Author: chenyiAlone
* Create Time: 2019/8/3 21:47
* Description: No.398 Random Pick Index
* 思路:
* 1. random.nextInt(++cnt) 用来获取下一个值
* 2. == 0 的概率为 1/cnt,也就是 nextInt(++cnt) 出现 0 的概率
*
* 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);
*
*/
public class RandomPickIndex {
private int[] nums;
private Random random;
public RandomPickIndex(int[] nums) {
this.nums = nums;
this.random = new Random();
}
public int pick(int target) {
int ret = -1;
int cnt = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] != target) continue;
if (random.nextInt(++cnt) == 0) ret = i;
}
return ret;
}
}