[LeetCode] 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);

 

解法：

　　因爲限制了空間，只能選擇省空間的隨機方法——水塘採樣了。咱們定義兩個變量，計數器count和返回結果result，咱們遍歷整個數組，若是數組的值不等於target，直接跳過；若是等於target，count加1，而後咱們在[0,count)範圍內隨機生成一個數字，若是這個數字是0（機率爲1/count，知足條件），咱們將result賦值爲i便可，參見代碼以下：

public class Solution {
    private int[] nums;
    
    public Solution(int[] nums) {
        this.nums = nums;
    }
    
    public int pick(int target) {
        int result = 0;
        int count = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] != target) {
                continue;
            }
            count++;
            if (new Random().nextInt(count) == 0) {
                result = i;
            }
        }
        return result;
    }
}

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