forked from gouthampradhan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathRandomPickIndex.java
62 lines (50 loc) · 1.57 KB
/
RandomPickIndex.java
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
50
51
52
53
54
55
56
57
58
59
60
61
62
package reservoir_sampling;
import java.util.Random;
/**
* Created by gouthamvidyapradhan on 10/12/2017.
* 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;
/**
* Main method
* @param args
* @throws Exception
*/
public static void main(String[] args) throws Exception{
int[] A = {1,2,3,3,3};
System.out.println(new RandomPickIndex(A).pick(1));
}
public RandomPickIndex(int[] nums) {
this.nums = nums;
}
public int pick(int target) {
int count = 0;
for (int num : nums) {
if (num == target) {
count++;
}
}
Random random = new Random();
int nPick = 1 + random.nextInt(count);
count = 0;
for(int i = 0; i < nums.length; i ++){
if(nums[i] == target){
if(++count == nPick){
return i;
}
}
}
return 0; //this is impossible
}
}