25. K 个一组翻转链表

最新推荐文章于 2024-07-14 09:49:31 发布

longying1999

最新推荐文章于 2024-07-14 09:49:31 发布

阅读量23

点赞数

分类专栏： Leetcode 文章标签：链表数据结构

本文链接：https://blog.csdn.net/longying1999/article/details/129773087

版权

Leetcode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

题目描述

方法：

pre->1(last)->2(cur)->3->4

pre->2->1(last)->3(cur)->4

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, val=0, next=None):
#         self.val = val
#         self.next = next
class Solution:
    def reverseKGroup(self, head: Optional[ListNode], k: int) -> Optional[ListNode]:
        def reverse(pre, stop):
            last = pre.next
            cur = last.next
            while cur != stop:
                last.next = cur.next
                cur.next = pre.next
                pre.next = cur
                cur = last.next
            return last

        if not head or k == 1:
            return head
        
        dump = ListNode(0)
        dump.next = head
        pre = dump
        cur = head
        i = 0
        while cur:
            i += 1
            if not i%k:
                pre = reverse(pre, cur.next)
                cur = pre.next
            else:
                cur = cur.next

        return dump.next