首页 > 编程语言 > 详细

shuff打乱排序

时间:2019-05-30 12:29:01      阅读:164      评论:0      收藏:0      [点我收藏+]
import random
alist=[1,2,3,4,5,6,7]
random.shuffle(alist,random=None)
技术分享图片
def shuffle(self, x, random=None):
        if random is None:
            randbelow = self._randbelow
            for i in reversed(range(1, len(x))):
                # pick an element in x[:i+1] with which to exchange x[i]
                j = randbelow(i+1)
                x[i], x[j] = x[j], x[i]
        else:
            _int = int
            for i in reversed(range(1, len(x))):
                # pick an element in x[:i+1] with which to exchange x[i]
                j = _int(random() * (i+1))
                x[i], x[j] = x[j], x[i]
shuffle源码

源码没有返回值,打乱的是原列表,所以不能print (random.shuffle(alist,random=None))

shuff打乱排序

原文:https://www.cnblogs.com/Bin-y/p/10948857.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!