摘要:
def BubbleSort(lst): for i in range(len(lst)-1): for j in range(len(lst)-1-i): if lst[j]>lst[j+1]: lst[j],lst[j+1] = lst[j+1],lst[j] return lst 首先,不知道 阅读全文
摘要:
leetcode例题: 216. Combination Sum III Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be 阅读全文