398. Random Pick Index

最新推荐文章于 2021-11-09 11:31:07 发布

xdhc304

最新推荐文章于 2021-11-09 11:31:07 发布

阅读量209

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode-java

本文链接：https://blog.youkuaiyun.com/xdhc304/article/details/78943468

leetcode 专栏收录该内容

599 篇文章

订阅专栏

本文介绍了一个算法问题的解决方案：给定一个可能包含重复元素的整数数组和一个目标值，随机返回目标值的一个索引。该算法使用了随机化的思想来确保每次选择的索引具有相同的概率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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[] nums;
    private Random random;

    public Solution(int[] nums) {
        this.nums = nums;
        this.random = new Random();
    }

    public int pick(int target) {
        int result = -1;
        int upbound = 1;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == target) {
                if (random.nextInt(upbound) == 0) {
                    result = i;
                } 
                upbound++;
            }
        }
        return result;
    }
}

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