要求: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();要求你定义一个类,具有三个方法:构造方法,Shuffle方法,reset方法
Shuffle方法:将传入的数组进行打乱,要求每种情况出现的概率是相同的。
reset方法:返回初始传入的那个数组。
注意:一开始想将一个数组的所有排列组合都列出来,再随机从中挑选一个返回。后来改为遍历整个数组,并且产生一个随机数randNum,将当前元素与array[randNum]进行交换,以达到每种可能出现情况概率相等的要求。(这里是不是真的每种情况出现概率相等?这里的随机数randNum实际上是伪随机的,所以这个问题有待商榷)
思考问题:写一个程序,要求它能打印出一个数组元素所有可能的排列组合。(最近考试,后面来实现这个问题)
public class Solution {
private ArrayList list = new ArrayList(); // 原始数组
public Solution(int[] nums) {
for (int i = 0; i < nums.length; i++)
list.add(nums[i]);
}
/** Resets the array to its original configuration and return it. */
public int[] reset() {
int[] re = new int[list.size()];
for (int i = 0; i < re.length; i++)
re[i] = Integer.parseInt(String.valueOf(list.get(i)));
return re;
}
/** Returns a random shuffling of the array. */
public int[] shuffle() {
int[] n = new int[list.size()];
int swap;
for (int i = 0; i < n.length; i++)
n[i] = Integer.parseInt(String.valueOf(list.get(i)));
for (int i = 0; i < n.length; i++) {
Random randNum = new Random();
int count = randNum.nextInt(n.length);
swap = n[i];
n[i] = n[count];
n[count] = swap;
}
return n;
}
}
/**
* 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();
*/