算法分析与设计课程（7）：【leetcode】Reverse Nodes in k-Group

Description:

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.

Only constant memory is allowed.

For example,
Given this linked list: 1->2->3->4->5

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5 

算法分析：


把一个链表每 k 个分为一组，每组内进行翻转。只能用常数级的空间。


这题比较考验链表的操作，用递归做会比较方便，先找到下一组的节点，把本组反转后再递归处理后面的节点。


代码如下：

class Solution:
    # @param head, a ListNode
    # @param k, an integer
    # @return a ListNode
    def reverseKGroup(self, head, k):
        #迭代版，时间复杂度O(n)，空间复杂度O(1)
        # Need help
        if head == None: return head
        dummy = ListNode(0)
        dummy.next = head
        start = dummy  #  start =0.   Given this linked list: 1->2->3->4->5    #    For k = 2, you should return: 2->1->4->3->5
        while start.next:
            end = start                                # end = 0
            for i in range(k-1):
                end = end.next                         # end = 1
                if end.next == None: return dummy.next
            (start.next, start)=self.reverse(start.next, end.next)  #  (start.next=3, start=1)=self.reverse(start.next=1, end.next=2)
        return dummy.next
        
    def reverse(self, start, end):
        dummy = ListNode(0)
        dummy.next = start
        while dummy.next != end:
            tmp = start.next
            start.next = tmp.next
            tmp.next = dummy.next
            dummy.next = tmp
            #start.next, start.next.next, dummy.next = start.next.next, dummy.next, start.next
            # The above line is wrong! But WHY?
        return (end, start)