random-pick-index

最新推荐文章于 2024-08-31 08:49:40 发布

转载最新推荐文章于 2024-08-31 08:49:40 发布 · 104 阅读

本文介绍了一种基于LeetCode的题目实现方案，通过构造一个类`Solution`来完成对数组中特定目标值的随机选取。该实现使用了哈希映射来存储每个数值对应的索引列表，并利用随机数生成器从列表中选择一个索引来返回。

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

https://leetcode.com/problems/random-pick-index/

public class Solution {

    private Map mp;
    private Random rand;
    
    public Solution(int[] nums) {
        mp = new HashMap();
        for (int i=0; i<nums.length; i++) {
            List lt = (ArrayList)mp.remove(nums[i]);
            if (lt == null) {
                lt = new ArrayList();
            }
            lt.add(i);
            mp.put(nums[i], lt);
        }
        rand = new Random();
    }
    
    public int pick(int target) {
        List lt = (ArrayList)mp.get(target);
        return (int)lt.get(rand.nextInt(lt.size()));
    }
}

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