66 leetcode - Partition List

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
Partition List
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.
For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.
'''

# Definition for singly-linked list.
class ListNode(object):
    def __init__(self, x):
        self.val = x
        self.next = None

class Solution(object):
    def partition(self, head, x):
        """
        :type head: ListNode
        :type x: int
        :rtype: ListNode
        """
        if None == head or head.next == None:
            return head

        Min = []
        Max = []
        ret = head
        while head:
            if head.val < x:
                Min.append(head)
            else:
                Max.append(head)
            head = head.next

        if not Min or not Max:
            return ret

        tmp = Min[0]

        for node in Min[1:]:
            tmp.next = node
            tmp = node

        for node in Max:
            tmp.next = node
            tmp = node
        tmp.next = None
        return Min[0]

if __name__ == "__main__":
    s = Solution()
    a = ListNode(2)
    b = ListNode(1)
    a.next = b
    b.next = None
    ret = s.partition(a,2)
    while ret:
        print ret.val
        ret = ret.next