Python 3.x 在python中生成随机字符串并进行匹配

Python 3.x 在python中生成随机字符串并进行匹配,python-3.x,random,Python 3.x,Random,这是一个python程序,用于生成一个随机字符串,并将其与用户给定的输出进行匹配,并获得计算机尝试次数的回报,但我无法获得尝试次数 随机输入 类txt: def __init__(self): self.txt = None trycount = 0 def maketxt(self,txt): txt = "" a = [] a.append(txt.split()) # return a

这是一个python程序,用于生成一个随机字符串,并将其与用户给定的输出进行匹配,并获得计算机尝试次数的回报,但我无法获得尝试次数 随机输入

类txt:

  def __init__(self):
        self.txt = None
        trycount = 0

  def maketxt(self,txt):
        txt = ""
        a = []
        a.append(txt.split())
       # return a

#  def match(self):
        tokenlist = ["a", "b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
        matchlist =[]
        while (len(matchlist) <=24):
              x =random.choice(tokenlist)
              matchlist.append(x)
        if matchlist == a:
              print(trycount)
        else :

              trycount += 1
              match()
def\uuuu初始化(自):
self.txt=无
trycount=0
def maketxt(自我,txt):
txt=“”
a=[]
a、 追加(txt.split())
#归还
#def匹配(自我):
令牌列表=[“a”、“b”、“c”、“d”、“e”、“f”、“g”、“h”、“i”、“j”、“k”、“l”、“m”、“n”、“o”、“p”、“q”、“r”、“s”、“t”、“u”、“v”、“w”、“x”、“y”、“z”]
匹配列表=[]

虽然(len(matchlist)使用self.trycount而不是trycounthi顺便说一句,谢谢你的帮助,我目前确实让代码进入了工作状态,但是python允许的递归数量有限,有一个问题,有没有办法访问更高数量的递归depthuse import sys,然后是sys.setrecursionlimit(depth).但是,在做这件事时要小心。