Random Pick Index
来源:互联网 发布:淘宝店如何看宝贝降权 编辑:程序博客网 时间:2024/06/04 23:28
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有很多个,然后在这些target中,随意挑选一个。算法就是:random.nextInt( count) 如果==0,那么就选当前的,否则还是之前的值不变。
public class Solution { Random random = new Random(); int[] array; public Solution(int[] nums) { this.array = nums; } public int pick(int target) { int result = 0; int upbound = 1; for(int i=0; i<this.array.length; i++){ if(array[i] == target){ if(random.nextInt(upbound) == 0){ result = i; } upbound++; } } return result; }}/** * 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
- Random Pick Index
- Random Pick Index
- Random Pick Index
- 398. Random Pick Index
- Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index**
- leetcode_middle_38_398. Random Pick Index
- leetcode398: Random Pick Index
- 398. Random Pick Index
- Random Pick Index
- 398. Random Pick Index
- 398. Random Pick Index
- 【Leetcode】398. Random Pick Index
- Leetcode 398. Random Pick Index
- C#自定义控件之-TabControl美化
- 第九周 稀疏矩阵的三元组表示的实现及应用
- opacity兼容
- Git与Repo入门
- 第九周项目4——-广义表算法库及应用(2)
- Random Pick Index
- rpm 命令
- H5 localStorage 和 sessionStorage 对json的处理方式
- Oracle中的tnsnames.ora文件修改后无法保存
- ListView子项item的显示与隐藏
- java文件配置Spring设置StringHttpMessageConverter
- jquery对动态添加内容添加事件
- iOS时间差8小时问题
- 配置spring+mybatis 所发现的奇怪问题