384. Shuffle an Array
Description
Given an integer array nums
, design an algorithm to randomly shuffle the array. All permutations of the array should be equally likely as a result of the shuffling.
Implement the Solution
class:
Solution(int[] nums)
Initializes the object with the integer arraynums
.int[] reset()
Resets the array to its original configuration and returns it.int[] shuffle()
Returns a random shuffling of the array.
Example 1:
1 | Input |
Constraints:
1 <= nums.length <= 50
-10^6 <= nums[i] <= 10^6
- All the elements of
nums
are unique . - At most
10^4
calls in total will be made toreset
andshuffle
.
Hints/Notes
- 2025/02/12 Q2
- design
- Good solution
Solution
Language: C++
1 | class Solution { |