leetcode-86-分割链表

题目描述：

方法一：

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

class Solution:
    def partition(self, head: ListNode, x: int) -> ListNode:
        before = before_head = ListNode(0)
        after = after_head = ListNode(0)
        while head:
            if head.val<x:
                before.next = ListNode(head.val)
                before = before.next
            else:
                after.next = ListNode(head.val)
                after = after.next
            head = head.next
        after.next = None
        before.next = after_head.next

        return before_head.next