摘要:
def quick_sort(list_a: list) -> list: if len(list_a) > 0: first = list_a[0] left = quick_sort([l for l in list_a[1:] if l < first]) right = quick_sort 阅读全文
摘要:
def cheng(a: int, b: int) -> int(): min_num = min(a, b) max_num = max(a, b) res = 0 for i in range(0, min_num): res += max_num return res print(cheng( 阅读全文