zoukankan      html  css  js  c++  java
  • 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);
    

     含义:给定一个可能包含重复元素的整数数组,给定一个目标数,随机输出其下标。你可以假设给定的目标数一定存在于数组中。

    注意:数组长度可能很大。使用较多额外空间的解决方案无法通过系统测试。

     1 class Solution {
     2 
     3     private int[] nums;
     4     public Solution(int[] nums) {
     5          this.nums = nums;
     6     }
     7     
     8     public int pick(int target) {
     9         Random r = new Random();        
    10         ArrayList<Integer> idxs = new ArrayList<Integer>();  
    11         for(int i=0;i<nums.length;i++){  
    12             if(target==nums[i]){  
    13                 idxs.add(i);  
    14             }  
    15         }  
    16         return idxs.get(r.nextInt(idxs.size()));   
    17     }
    18 }
    19 
    20 /**
    21  * Your Solution object will be instantiated and called as such:
    22  * Solution obj = new Solution(nums);
    23  * int param_1 = obj.pick(target);
    24  */
     
  • 相关阅读:
    一次http请求,谁会先断开TCP连接?什么情况下客户端先断,什么情况下服务端先断?
    nginx.conf详解
    50:树中两个结点的最低公共祖先
    49:把字符串转换为整数
    48:不能被继承的类
    47:不用加减乘除做加法
    46:求1+2+...+n
    45:圆圈中最后剩下的数字
    44:扑克牌顺子
    43:n个骰子的点数
  • 原文地址:https://www.cnblogs.com/wzj4858/p/7732069.html
Copyright © 2011-2022 走看看