其他分享
首页 > 其他分享> > 384. Shuffle an Array

384. Shuffle an Array

作者:互联网

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();

 

标签:set,Shuffle,nums,solution,its,384,shuffle,Array,array
来源: https://www.cnblogs.com/clarencezzh/p/10959777.html