题目如下：
这道题我的解法效率不是特别高，抛砖引玉，代码如下，我会找时间重新再写另外一个解法：
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 |
class Solution: def reverseKGroup(self, head, k): """ :type head: ListNode :type k: int :rtype: ListNode """ if head is None or head.next is None or k == 1: return head temp = [] reverse_list = [] while head is not None: temp.append(head.val) head = head.next if k == len(temp): temp.reverse() cur = ListNode(temp[0]) head = cur cur = ListNode(temp[1]) head.next = cur for j in range(2, len(temp)): cur.next = ListNode(temp[j]) cur = cur.next return head i = 0 while i + k <= len(temp): re_temp = temp[i:i + k] re_temp.reverse() for t in re_temp: reverse_list.append(t) i = i + k for t in temp[i:]: reverse_list.append(t) cur = ListNode(reverse_list[0]) head = cur cur = ListNode(reverse_list[1]) head.next = cur for j in range(2, len(reverse_list)): cur.next = ListNode(reverse_list[j]) cur = cur.next return head |
如果您有好的建议，欢迎来信与我交流
也欢迎关注微信公众号“苔原带”
