zoukankan      html  css  js  c++  java
  • 2018-12-13丛晓强作业

    实现发牌器(排中不包含大小鬼),共4个玩家,没人13张牌

    import random
    zhangsan = []
    lisi = []
    wangwu = []
    liuer = []
    puke = []
    l = ["A","2","3","4","5","6","7","8","9","10","J","Q","K"]
    w = ["红桃","方片","梅花","黑桃"]
    for i in w:
        for s in l:
            y = "{}{}".format(i,s)
            puke.append(y)
    print("一共有这些{}扑克".format(puke))
    class Puke:
        def zhangsan(self):
            for i in range(13):
                a = random.choice(puke)
                zhangsan.append(a)
                puke.pop(puke.index(a))
            print("zhangsan的扑克为{}".format(zhangsan))
    
        def lisi(self):
            for i in range(13):
                a = random.choice(puke)
                lisi.append(a)
                puke.pop(puke.index(a))
            print("lisi扑克为{}".format(lisi))
    
        def wangwu(self):
            for i in range(13):
                a = random.choice(puke)
                wangwu.append(a)
                puke.pop(puke.index(a))
            print("wangwu扑克为{}".format(wangwu))
    
        def liuer(self):
            for i in range(13):
                a = random.choice(puke)
                liuer.append(a)
                puke.pop(puke.index(a))
            print("liuer扑克为{}".format(liuer))
    
    ren= Puke()
    ren.wangwu()
    ren.lisi()
    ren.liuer()
    ren.zhangsan()
  • 相关阅读:
    Corn Fields
    状压DP
    全排列函数
    搜索
    前缀和与差分
    最小花费
    【Lintcode】062.Search in Rotated Sorted Array
    【LeetCode】039. Combination Sum
    【LeetCode】040. Combination Sum II
    【LeetCode】047. Permutations II
  • 原文地址:https://www.cnblogs.com/youmeishaoye/p/10117143.html
Copyright © 2011-2022 走看看