本文共 1209 字,大约阅读时间需要 4 分钟。
class Solution(object): def reverseKGroup(self, head, k): def count(h): cnt = 0 while h:h=h.next;cnt+=1 return cnt # def reverse(pre,k): # s = [] # h=pre # pre=pre.next # j = 0 # for i in range(k): # j+=1 # s.append(pre.val) # pre=pre.next # pre = h.next # last = None # for i in range(j-1,-1,-1): # pre.val = s[i] # last = pre # pre = pre.next # return last def reverse(pre,k): head = pre.next cur = head.next for i in range(k-1): head.next = cur.next cur.next = pre.next pre.next = cur cur = head.next return head pre = ListNode(0) Head = pre start,n = 0,count(head) pre.next = head while start+k<=n: pre = reverse(pre,k) start+=k return Head.next
转载地址:http://smrkn.baihongyu.com/