剑指offer15.反转链表

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/sinat_36811967/article/details/85838774

https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking

题目描述
输入一个链表,反转链表后,输出新链表的表头。

先用tmp储存head.next,然后将head插入res后面,最后将tmp赋值给head:

# -*- coding:utf-8 -*-
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    # 返回ListNode
    def ReverseList(self, pHead):
        # write code here
        res = ListNode(0)
        while pHead:
            tmp = pHead.next
            pHead.next = res.next
            res.next = pHead
            pHead = tmp
        return res.next

猜你喜欢

转载自blog.csdn.net/sinat_36811967/article/details/85838774