本文共 1165 字，大约阅读时间需要 3 分钟。

本系列文章为《剑指Offer》刷题笔记。

刷题平台：

# -*- coding:utf-8 -*-# class ListNode:#     def __init__(self, x):#         self.val = x#         self.next = Noneclass Solution:    # 返回ListNode    def ReverseList(self, pHead):        # write code here        if not pHead or not pHead.next:            return pHead        cur , prev= pHead,None        while cur:            temp = cur.next            cur.next = prev            prev = cur            cur = temp        return prev

【解法2】三个指针

# -*- coding:utf-8 -*-# class ListNode:#     def __init__(self, x):#         self.val = x#         self.next = Noneclass Solution:    # 返回ListNode    def ReverseList(self, pHead):        # write code here        if not pHead or not pHead.next:            return pHead                prev=None        cur = pHead        post = cur.next                while post:            cur.next = prev            prev = cur            cur = post            post = post.next        cur.next = prev    # 最后还要给prev一下        return cur

注：至此，是cur完成了所有链表元素的遍历。prev也可以，但还要加一句prev = cur

参考 https://www.jb51.net/article/190180.htm

转载地址：http://fyjii.baihongyu.com/