Lintcode 96. Partition List (Easy) (Python)

最新推荐文章于 2021-08-02 16:23:11 发布

2Young2Simple

最新推荐文章于 2021-08-02 16:23:11 发布

阅读量192

点赞数

文章标签： Lintcode Python

本文链接：https://blog.csdn.net/weixin_41677877/article/details/81301511

版权

Partition List

Description:

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of the two partitions.

Example
Given 1->4->3->2->5->2->null and x = 3,
return 1->2->2->4->3->5->null.

Code:

"""
Definition of ListNode
class ListNode(object):
    def __init__(self, val, next=None):
        self.val = val
        self.next = next
"""

class Solution:
    """
    @param head: The first node of linked list
    @param x: An integer
    @return: A ListNode
    """
    def partition(self, head, x):
        # write your code here
        list1 = ListNode(0)
        list2 = ListNode(0)
        list1.next = head
        ind1 = list1
        ind2 = list2
        move = False 
        while ind1.next:
            if ind1.next.val < x:
                ind2.next = ind1.next
                ind1.next = ind1.next.next
                ind2 = ind2.next
                ind2.next = None
            else:
                ind1 = ind1.next
                move = True
        ind2.next = list1.next
        return list2.next