摘要: 双指针法反转链表 # class ListNode: # def __init__(self, x): # self.val = x # self.next = None def f(head): pre = None cur = head while cur != None: # 提前暂存当前节点 阅读全文
posted @ 2020-09-29 23:20 绿茶编程 阅读(61) 评论(0) 推荐(0)