92. Reverse Linked List II刷题笔记

最新推荐文章于 2024-05-15 22:16:41 发布

waiting不是违停

最新推荐文章于 2024-05-15 22:16:41 发布

阅读量82

点赞数

分类专栏： LeetCode Python刷题文章标签： list 链表数据结构

本文链接：https://blog.csdn.net/weixin_44737922/article/details/125905679

版权

LeetCode Python刷题专栏收录该内容

221 篇文章 1 订阅

订阅专栏

用栈来解决

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseBetween(self, head: Optional[ListNode], left: int, right: int) -> Optional[ListNode]:
        root = ListNode(next = head)
        cur = root
        i = 1
        stack = []
        while i<left:
            cur = cur.next
            i += 1
        node = cur
            
        while i<=right:
            cur = cur.next
            stack.append(cur)
            i += 1
        cur = cur.next
        while stack:
            node.next = stack.pop()
            node = node.next
        node.next = cur
        return root.next