86. Partition List（python）

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.
题意理解：分区，小于3的在大于等于3的前面，每个区的原始顺序不变
思路：新建两个链表，一个存放小于x，一个存放大于x,再拼接即可
Runtime: 55 ms

# 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):
        if not head or not head.next:
            return head
        p=head
        dummyA=ListNode(0)
        p1=dummyA
        dummyB=ListNode(0)
        p2=dummyB
        while p:
            if p.val<x:
                p1.next=p
                p1=p1.next
            else:
                p2.next=p
                p2=p2.next
            p=p.next
        p1.next=dummyB.next
        p2.next=None
        return dummyA.next