384. Shuffle an Array(随机排序)

最新推荐文章于 2021-02-27 16:16:43 发布

weixin_30628801

最新推荐文章于 2021-02-27 16:16:43 发布

阅读量57

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/bernieloveslife/p/9805455.html

本文介绍了一种使用Python实现的洗牌算法，该算法能够对不含重复元素的数字集进行随机排列。通过创建Solution类，实现了数组的初始化、重置及随机洗牌功能，确保每次调用shuffle方法都能得到等概率的数组排列。

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

import random
class Solution:

    def __init__(self, nums):
        """
        :type nums: List[int]
        """
        self.nums = nums

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

    def shuffle(self):
        """
        Returns a random shuffling of the array.
        :rtype: List[int]
        """
        return sorted(self.nums,key=lambda x:random.random())

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

转载于:https://www.cnblogs.com/bernieloveslife/p/9805455.html