###### 【leetcode】384. Shuffle an Array【M】

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


Subscribe to see which companies asked this question

python有个自带算法，shuffle，直接用。。

class Solution(object):

def __init__(self, nums):
self.origin = nums
#self.res = nums
"""

:type nums: List[int]
:type size: int
"""

def reset(self):
#self.res = self.origin
return self.origin
"""
Resets the array to its original configuration and return it.
:rtype: List[int]
"""

def shuffle(self):
res = self.origin[:]
random.shuffle(res)

return res
"""
Returns a random shuffling of the array.
:rtype: List[int]
"""

# Your Solution object will be instantiated and called as such:
# obj = Solution(nums)
# param_1 = obj.reset()
# param_2 = obj.shuffle()

#### Leetcode 103. Binary Tree Zigzag Level Order Traversal 二叉树Zigzag遍历 解题报告

2016-09-09 12:26:27

#### Binary Tree Zigzag Level Order Traversal （二叉树锯齿形层次遍历）

2014-03-08 09:27:37

#### LeetCode 103. Binary Tree Zigzag Level Order Traversal（二叉树之字形遍历）

2016-05-23 03:58:09

#### Binary Tree Zigzag Level Order Traversal 二叉树ZigZag打印

2016-05-26 20:08:00

#### LeetCode103 BinaryTreeZigzagLevelOrderTraversal(二叉树Z形层次遍历) Java题解

2015-07-09 17:08:19

#### 【LeetCode】103. Binary Tree Zigzag Level Order Traversal 解题报告

2016-05-28 12:04:05

#### 【LeetCode-面试算法经典-Java实现】【103-Binary Tree Zigzag Level Order Traversal（二叉树分层Z字形遍历）】

2015-08-08 06:35:14

#### LeetCode—Binary Tree Zigzag Level Order Traversal 二叉树的Z扫描

2015-04-08 14:01:51

#### 【LeetCode笔记】Binary Tree Zigzag Level Order Traversal 二叉树Z字形遍历

2017-04-09 15:37:59

#### Binary Tree Zigzag Level Order Traversal

2014-05-30 20:50:42

## 不良信息举报

【leetcode】384. Shuffle an Array【M】