398. Random Pick Index

---

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);

通过一个HashMap保存数组中值-下标的映射，程序如下所示：

class Solution {
    
    Map<Integer, List<Integer>> map = new HashMap<>();
    Random random = new Random();

    public Solution(int[] nums) {
        for (int i = 0; i < nums.length; ++ i){
            List<Integer> l;
            if (map.containsKey(nums[i])){
                l = map.get(nums[i]);
                l.add(i);
            }
            else {
                l = new ArrayList<>();
                l.add(i);
            }
            map.put(nums[i], l);
        }
    }
    
    public int pick(int target) {
        List<Integer> l = map.get(target);
        int index = random.nextInt(l.size());
        return l.get(index);
    }
}

/**
 * Your Solution object will be instantiated and called as such:
 * Solution obj = new Solution(nums);
 * int param_1 = obj.pick(target);
 */