206. Reverse Linked List

蜉蝣之翼❉

已于 2024-03-08 10:02:24 修改

阅读量489

点赞数 8

分类专栏：程序员英语面试文章标签：算法

于 2024-03-06 22:04:37 首次发布

本文链接：https://blog.csdn.net/fuyouzhiyi/article/details/136517533

版权

程序员英语面试专栏收录该内容

22 篇文章 15 订阅

订阅专栏

本文介绍了一个问题，给定一个单链表的头节点，要求逆序链表并提供两种方法：迭代和递归。作者提供了使用Python实现的迭代解决方案。

摘要由CSDN通过智能技术生成

Given the head of a singly linked list, reverse the list, and return the reversed list.

Example 1:

Input: head = [1,2,3,4,5]
Output: [5,4,3,2,1]
Example 2:

Input: head = [1,2]
Output: [2,1]
Example 3:

Input: head = []
Output: []

Constraints:

The number of nodes in the list is the range [0, 5000].
-5000 <= Node.val <= 5000

Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?

# 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]:
        preNode = None
        curNode = head

        while curNode:
            nextNode = curNode.next
            curNode.next=preNode

            preNode = curNode
            curNode = nextNode
        return preNode