python写算法题：leetcode: 25. Reverse Nodes in k-Group

激荡数十年

于 2017-06-29 21:29:51 发布

阅读量284

点赞数

分类专栏： python 算法

本文链接：https://blog.csdn.net/lzf_china/article/details/73928255

版权

算法同时被 2 个专栏收录

158 篇文章 0 订阅

订阅专栏

python

115 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/reverse-nodes-in-k-group/#/description

class Solution(object):
    def reverseNode(self, nodes, k):
        for ind in xrange(k):
            node = nodes
            for v in xrange(k-ind-1):
                if not node: return None,None
                node = node.next
            if not node: return None,None
            if ind != 0:
                baknode.next = node
            else:
                headnode = node
                nheadnode = node.next
            baknode = node
        node.next=nheadnode
        return headnode,nheadnode

    def reverseKGroup(self, head, k):
        """
        :type head: ListNode
        :type k: int
        :rtype: ListNode
        """
        if k <= 1:
            return head
#        a ...    bc .... de....
#        b ...    ad .... cf....
        bnode,cnode = self.reverseNode(head, k)

        if not bnode:
            return head

        newhead = bnode
        anode   = head

        while bnode.next:
            dnode,cnode1 = self.reverseNode(cnode, k)
            if not dnode:
                break

            anode.next = dnode
            anode = cnode
            cnode = cnode1
            bnode = dnode
        return newhead