https://github.com/emahtab/shuffle-an-array
Shuffle an array
https://github.com/emahtab/shuffle-an-array
array fisher-yates-shuffle leetcode problem-solving shuffle
Last synced: about 1 month ago
JSON representation
Shuffle an array
- Host: GitHub
- URL: https://github.com/emahtab/shuffle-an-array
- Owner: eMahtab
- Created: 2020-04-29T17:28:34.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2020-04-29T17:30:00.000Z (almost 6 years ago)
- Last Synced: 2025-10-28T06:23:35.118Z (5 months ago)
- Topics: array, fisher-yates-shuffle, leetcode, problem-solving, shuffle
- Homepage:
- Size: 1000 Bytes
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Shuffle an array
## https://leetcode.com/problems/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();
```
# Implementation :
```java
class Solution {
private int[] array;
private int[] cloned;
private Random rand = new Random();
public Solution(int[] nums) {
array = nums;
cloned = nums.clone();
}
private List getArrayCopy() {
List asList = new ArrayList();
for (int i = 0; i < array.length; i++) {
asList.add(array[i]);
}
return asList;
}
/** Resets the array to its original configuration and return it. */
public int[] reset() {
return cloned;
}
/** Returns a random shuffling of the array. */
public int[] shuffle() {
List aux = getArrayCopy();
for (int i = 0; i < array.length; i++) {
int removeIdx = rand.nextInt(aux.size());
array[i] = aux.get(removeIdx);
aux.remove(removeIdx);
}
return array;
}
}
/**
* 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();
*/
```