-
Notifications
You must be signed in to change notification settings - Fork 101
/
Copy pathRandomPickIndex398.java
75 lines (66 loc) · 2.02 KB
/
RandomPickIndex398.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
63
64
65
66
67
68
69
70
71
72
73
74
75
/**
* 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 RandomPickIndex398 {
class Solution {
private Map<Integer, List<Integer>> map = new HashMap<>();
private Random rand = new Random();
public Solution(int[] nums) {
for (int i=0; i<nums.length; i++) {
if (!map.containsKey(nums[i])) {
map.put(nums[i], new ArrayList<>());
}
map.get(nums[i]).add(i);
}
}
public int pick(int target) {
int idx = rand.nextInt(map.get(target).size());
return map.get(target).get(idx);
}
}
class Solution2 {
private int[] nums;
private Random random;
public Solution2(int[] nums) {
this.nums = nums;
this.random = new Random();
}
public int pick(int target) {
int count = 0;
int res = -1;
for (int i = 0; i < nums.length; i++) {
if (nums[i] == target) {
count++;
int rand = random.nextInt(count) + 1;
if (rand == count) {
res = i;
}
}
}
return res;
}
}
/**
* Your Solution object will be instantiated and called as such:
* Solution obj = new Solution(nums);
* int param_1 = obj.pick(target);
*/
}