Leetcode 86 分隔链表【链表】

1.代码

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

class Solution:
    def partition(self, head, x):
        """
        :type head: ListNode
        :type x: int
        :rtype: ListNode
        """
        while head == None or head.next == None or x == None:
            return head
        
        
        p1 = head1 = ListNode(0)    #一个操作指针p1，一个记录头地址指针head1
        p2 = head2 = ListNode(0)
        p = head
        
        while p:
            if p.val < x:
                p1.next = p
                p1 = p1.next
            else:
                p2.next = p
                p2 = p2.next
            p = p.next
            
        p1.next = head2.next
        p2.next = None
        return head1.next