@@ -0,0 +1,744 @@
+# Definition for singly-linked list.%0A# class ListNode:%0A#     def __init__(self, x):%0A#         self.val = x%0A#         self.next = None%0A%0Aclass Solution:%0A    # @param %7BListNode%7D head%0A    # @param %7Binteger%7D x%0A    # @return %7BListNode%7D%0A    def partition(self, head, x):%0A        if head == None or head.next == None:%0A            return head%0A        dump = ListNode(0)%0A        dump.next = head%0A        p = dump%0A        %0A        dump1 = ListNode(0)%0A        q = dump1%0A        while p.next != None:%0A            if p.next.val %3C x:%0A                p = p.next%0A            else:%0A                q.next = p.next%0A                q = q.next%0A                p.next = p.next.next%0A        %0A        q.next = None%0A        p.next = dump1.next%0A        return dump.next%0A

Create PartitionList_001.py