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.

示例:

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);

问题分析：

随机抽样问题，可采用Reservoir Sampling方法求解。

过程详见代码：

class Solution {
public:
    vector<int> nums;
	Solution(vector<int> nums) {
		this->nums = nums;
		srand(time(NULL));
	}

	int pick(int target) {
		int res = -1;
		int count = 0;
		for (int i = 0; i < nums.size(); i++)
		{
			if (nums[i] != target) continue;
			if (rand() % (++count) == 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);
 */