LeetCode[398] Random Pick Index

本文介绍了一种在大规模数组中高效随机选取指定目标值索引的算法——水塘抽样。该算法适用于可能含有重复元素的大数组,并能在不消耗过多额外空间的情况下,确保每个符合条件的元素被选中的概率相同。

摘要生成于 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 {
public:
	Solution(vector<int> nums) {
		number = nums;
	}

	int pick(int target) {
		int alpha = 1;
		int resIndex;
		for (int i = 0; i < number.size(); ++i) {
			if (number[i] == target) {
				if (rand() % alpha == 0)
					resIndex = i;
				++alpha;
			}
		}
		return resIndex;
	}
private:
	vector<int> number;
};


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

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值