- Shuffle an Array
原创
wx62ea2466cca9a博主文章分类：leetcode ©著作权
文章标签 leetcode-java 文章分类 Hadoop 大数据
©著作权归作者所有：来自51CTO博客作者wx62ea2466cca9a的原创作品，请联系作者获取转载授权，否则将追究法律责任
Shuffle a set of numbers without duplicates.
Example:
// Init an array with set 1, 2, and 3.int[] nums = {1,2,3};Solution solution = new Solution(nums);// Shuffle the array [1,2,3] and return its result. Any permutation of [1,2,3] must equally likely to be returned.solution.shuffle();// Resets the array back to its original configuration [1,2,3].solution.reset();// Returns the random shuffling of array [1,2,3].solution.shuffle();
class Solution { private int[] original; private Random rng = new Random(); private int[] copy; private int num; public Solution(int[] nums) { original = nums; copy=original.clone(); num=original.length; } /** Resets the array to its original configuration and return it. */ public int[] reset() { return original; } /** Returns a random shuffling of the array. */ public int[] shuffle() { int n = num; while(n>1) { n--; int k = rng.nextInt(n + 1); int value = copy[k]; copy[k] = copy[n]; copy[n] = value; } return copy; }}/** * Your Solution object will be instantiated and called as such: * Solution obj = new Solution(nums); * int[] param_1 = obj.reset(); * int[] param_2 = obj.shuffle(); */
- 赞
- 收藏
- 评论
- *举报
上一篇：382. Linked List Random Node
Original: https://blog.51cto.com/u_15740726/5541906
Author: wx62ea2466cca9a
Title: 384. Shuffle an Array
原创文章受到原创版权保护。转载请注明出处：https://www.johngo689.com/508371/
转载文章受原作者版权保护。转载请注明原作者出处！