[LC] 398. Random Pick Index

Posted xuanlu

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LC] 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);

class Solution {

    private int[] arr;
    private Random rand;
    
    public Solution(int[] nums) {
        this.arr = nums;
        this.rand = new Random();
    }
    
    public int pick(int target) {
        int count = 0;
        int res = -1;
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] != target) {
                continue;
            }
            count += 1;
            int randNum = rand.nextInt(count);
            if (randNum == 0) {
                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);
 */

以上是关于[LC] 398. Random Pick Index的主要内容,如果未能解决你的问题,请参考以下文章

398. Random Pick Index

398. Random Pick Index

398. Random Pick Index

398. Random Pick Index

leetcode_398 Random Pick Index(Reservoir Sampling)

398 Random Pick Index 随机数索引