摘要:
def func1(n, base): convertion = '0123456789ABCDE' if n < base: return convertion[n] else: return func1(n // base, base) + convertion[n % base]def fun 阅读全文
摘要:
# 判断是否是回文def func1(s: str): s1 = list(s) while len(s1) > 1: if s1.pop() != s1.pop(0): return False return True# 求子串中最长回文def func2(s: str): s1 = list(s 阅读全文
摘要:
# 打印机设置class Printer: def __init__(self, ppm): self.pagerate = ppm self.currentTask = None self.timeRemaining = 0 def tick(self): if self.currentTask 阅读全文
摘要:
# 热土豆/约瑟夫问题def func1(s: list, n: int): temp = [] while len(s) > 0: if len(s) > 1: for i in range(n): s.append(s.pop(0)) temp.append(s.pop()) return te 阅读全文
摘要:
# 中缀表达式转为后缀表达式def func1(s: str): s1temp = [] s2temp = [] for i in s.split(): if i.isdigit(): s1temp.append(i) elif i in '*/+-': s2temp.append(i) elif 阅读全文