【leetcode】384. Shuffle an Array【M】

最新推荐文章于 2025-01-27 23:45:00 发布

原创最新推荐文章于 2025-01-27 23:45:00 发布 · 754 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #leetcode题解 #python #随机数

Python 同时被 3 个专栏收录

176 篇文章

订阅专栏

leetcode

175 篇文章

订阅专栏

算法

157 篇文章

订阅专栏

本文介绍了一个简单的Python类，用于实现数组的随机洗牌功能。该类通过初始化接收一个不重复的数字数组，并提供了两个主要的方法：reset()用于将数组重置为原始状态；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();

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

您可能感兴趣的与本文相关的镜像