LeetCode—398. Random Pick Index

Integer Replacement思路：注意The array size can be very large. Solution that uses too much extra space will not pass the judge.不能开辟额外空间，所以更换随机方式。

GitHub地址：https://github.com/corpsepiges/leetcode

点此进入如果可以的话，请点一下star，谢谢。

public class Solution {
    Random r;
    int[] nums;
    public Solution(int[] nums) {
        r=new Random();
        this.nums=nums;
    }
    public int pick(int target) {
        int index=0;
        int times=0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i]==target) {
                if (r.nextInt(++times)==0) {
                    index=i;
                }
            }
        }
        return index;
    }
}

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