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