数据结构与算法

链表的反转

2019-12-21  本文已影响0人  而立之年的技术控
微信图片_20191221163851.jpg
class Solution:
    # 返回ListNode
    def ReverseList(self, pHead):
        # write code here
        if pHead is None:
            return None
        if pHead.next is None:
            return pHead
        pre = pHead
        cur = pHead.next
        last = pHead.next.next
        pre.next = None
        
        while last != None:
            cur.next = pre
            pre = cur
            cur = last
            last = last.next
        cur.next = pre
        return cur
上一篇 下一篇

猜你喜欢

热点阅读