码迷,mamicode.com
首页 > 其他好文 > 详细

384. Shuffle an Array

时间:2016-08-12 10:12:11      阅读:278      评论:0      收藏:0      [点我收藏+]

标签:

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

Solution: think about how you shuffle a deck of cards. You pick a card, and use it as the first/last card, then pick a second one, use it as a second/second last one.......

public class Solution {

  private int[] orig = null;
  private int[] current = null;
  private Random random = new Random();

  public Solution(int[] nums) {
    this.orig = nums;
    this.current = nums.clone();
  }

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

  /**
   * Returns a random shuffling of the array.
   */
  public int[] shuffle() {
    for (int i = 0; i < current.length; ++i) {
      int pick = random.nextInt(current.length);
      int swap = current.length - 1 - i;
      int temp = current[swap];
      current[swap] = current[pick];
      current[pick] = temp;
    }
    return current;
  }
}

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

 

384. Shuffle an Array

标签:

原文地址:http://www.cnblogs.com/neweracoding/p/5763839.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!