九龙坡网站建设多少钱上海搬家公司收费

1、题目描述

给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。

示例 1：

输入：head = [1,2,3,4,5]
输出：[5,4,3,2,1]

2、初始思路

2.1 思路

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:current = headpre = Nonewhile current:nextn = current.nextcurrent.next = prepre = currentcurrent = nextnreturn pre