Re: [閒聊] 每日leetcode 169

[DJYOMIYAHINA (通通打死)]

25. Reverse Nodes in k-Group

才發現沒寫過這個

def reverseKGroup(self, head: Optional[ListNode], k: int) -> Optional[ListNode
]:
        # check length
        cur = head
        for i in range(k):
            if cur:
                cur = cur.next
            else:
                return head

        cur, prev = head, self.reverseKGroup(cur, k)
        for i in range(k):
            nxt = cur.next
            cur.next = prev
            prev = cur
            cur = nxt
        return prev


用遞迴挺好搞得
時隔13個月再次寫出hard

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 220.132.58.28 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1753599600.A.E71.html
推 wwndbk: 大師