398. Random Pick Index

398. Random Pick Index

 

Question Editorial Solution

  My Submissions

• Total Accepted: 1143
• Total Submissions: 4319
• Difficulty: Medium

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的下标存储在一个vector<int>中，然后随机返回一个下标。

通过的代码：

class Solution {
    vector<int> ns;
public:
    Solution(vector<int> nums) {
        ns=nums;
    }
    
    int pick(int target) {
        int i,n=ns.size();
        vector<int> v;
        for(i=0;i<n;i++)
        {
            if(ns[i]==target)
            v.push_back(i);
        }
        int m=v.size();
        return v[rand()%m];
        
    }
};