398. Random Pick Index**
来源:互联网 发布:算法心得这书怎么样 编辑:程序博客网 时间:2024/05/21 06:55
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);
public class Solution { int[] nums; Random rand; public Solution(int[] nums) { this.nums=nums; this.rand = new Random(); } public int pick(int target) { int total = 0; int res = -1; for(int i=0;i<nums.length;i++){ if(nums[i]==target){ int x = rand.nextInt(++total); res = x==0?i:res; } } return res; }}/** * Your Solution object will be instantiated and called as such: * Solution obj = new Solution(nums); * int param_1 = obj.pick(target); */
0 0
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index**
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 【Leetcode】398. Random Pick Index
- Leetcode 398. Random Pick Index
- [LeetCode] 398. Random Pick Index
- LeetCode 398. Random Pick Index
- [Leetcode]398. Random Pick Index
- 【Leetcode】398. Random Pick Index
- 【LeetCode】 398. Random Pick Index
- 398. Random Pick Index (M)
- LeetCode 398. Random Pick Index
- [BZOJ4553][Tjoi2016&Heoi2016]序列 CDQ分治
- C++学习笔记:C的继承与超越——指针与引用
- (四)Hololens Unity 开发之 凝视系统
- 进程wait()与waitpid()
- myeclipse hibernate反转引擎
- 398. Random Pick Index**
- [BZOJ4567][Scoi2016]背单词 字典树+贪心
- 04-垂直直方图
- mysql学习笔记(四)数据库及表的修改和删除
- 三国名将之高顺
- Spring注解的使用积累
- POj 2528 Mayor's posters
- 1. Two Sum
- Haskell语言学习笔记(5)Applicative