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