【发布时间】:2021-10-10 10:14:05
【问题描述】:
如何更改函数以使其不再是递归的?我认为内存缓冲区正在被填充。
代码:
def start_play():
start = driver.find_element_by_xpath('/html/body/div[27]/div[2]/div[3]/div[1]/div[1]/span')
start = start.text
start = re.findall(r'\d+', start)
if len(start) == 0:
# t.sleep(2)
return start_play()
else:
if start[0] == '3' or start[0] == '4':
comparison()
else:
return start_play()
def check_win_or_lose():
start = driver.find_element_by_xpath('/html/body/div[27]/div[2]/div[3]/div[1]/div[1]/span')
start = start.text
start = re.findall(r'\d+', start)
if len(start) == 0:
return check_win_or_lose()
else:
if start[0] == '22' or start[0] == '23':
check()
last_bet.clear()
else:
return check_win_or_lose()
【问题讨论】:
-
您的代码中没有退出条件。它一直运行直到达到最大深度。
标签: python python-3.x selenium recursion