LeetCode 086 Partition List

LeetCode 086 Partition List Problem

Download Code
# 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 head is None:
            return None
        less = lesshead = None
        last = pos = head
        while pos is not None:
            if pos.val < x:
                if lesshead is None:
                    lesshead = pos
                    less.next = pos
                less = pos
                if head == pos:
                    last = head = pos.next
                    last.next = pos.next
                last = pos
            pos = pos.next
        if lesshead is not None:
            less.next = head
            lesshead = head
        return lesshead
Download Partition List.py

List of all Partition List problems

Leetcode 086 Partition List problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.