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

思路：因为不能使用过多额外的空间，所以，针对target，获得所有出现位置，然后利用随机算法进行输出

代码1：

class Solution {
public:
    vector<int> num;
    Solution(vector<int> nums) {
        num=nums;
    }
    
    int pick(int target) {
        vector<int> res;
        for(int i=0;i<num.size();i++){
            if(num[i]==target){res.push_back(i);}
        }
        int ind=rand()%(res.size());
        return res[ind];
            
    }
};

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

代码2：

class Solution {
public:
    vector<int> s;
    Solution(vector<int> nums) {
        s=nums;
    }
    
    int pick(int target) {
        vector<int> res;
        int cnt=0;
        for(int i=0;i<s.size();i++){
            if(s[i]==target){cnt++;}
        }
        cnt=rand()%cnt+1;
        for(int i=0;i<s.size();i++){
            if(s[i]==target){
                cnt--;
                if(cnt==0){return i;}
            }
        }
    }
};

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