摘要： 双指针法反转链表 # class ListNode: # def __init__(self, x): # self.val = x # self.next = None def f(head): pre = None cur = head while cur != None: # 提前暂存当前节点 阅读全文

摘要： 交换类排序：冒泡 L = [1,3,2,4,1] n = len(L) for i in range(n-1, 0, -1): for j in range(1, i + 1): # 每趟比较的次数(第一趟比较n-1次) if L[j-1] > L[j]: temp = L[j] L[j] = L[ 阅读全文