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

数值在数组中可能出现多次，需要等概率返回给定数值对应的下标。采用的方法是蓄水池法，假设遍历到第count个目标值，有1/count的概率改成这个目标值对应的下标。

class Solution {
public:
    Solution(vector<int> nums) {
        v=nums;
    }
    int pick(int target) {
        int count=0;
        int result;
        for(int i=0;i<v.size();i++)
        {
            if(target==v[i])
            {
                count++;
                if(rand()%count==0) result=i;
            }
        }
        return result;
    }
private:
    vector<int> v;
};
/**
 * Your Solution object will be instantiated and called as such:
 * Solution obj = new Solution(nums);
 * int param_1 = obj.pick(target);
 */