leetcode ShuffleanArray
z
 2019-04-09 10:36:27   
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
public class ShuffleanArray {
  /**
   * 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();
   */
  int [] OriginalNums;
  public ShuffleanArray(int[] nums) {
    this.OriginalNums = nums;
  }

  /** Resets the array to its original configuration and return it. */
  public int[] reset() {
    return this.OriginalNums;
  }

  /** Returns a random shuffling of the array. */
  public int[] shuffle() {
    return this.OriginalNums;
  }
}