Partition List LeetCode Solution

Here, We see Partition List LeetCode Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc. with different approaches.

List of all LeetCode Solution

Problem Statement

Given the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of the two partitions.

Example 1:

Input: head = [1,4,3,2,5,2], x = 3
Output: [1,2,2,4,3,5]

Example 2:

Input: head = [2,1], x = 2
Output: [1,2]

Partition List Leetcode Solution C++

class Solution {
public:
ListNode* partition(ListNode* head, int x) {
ListNode* left = new ListNode(), *right = new ListNode();
ListNode *newHead = left, *mid = right;

if(head->val < x) {
left = left->next;
}
else {
right = right->next;
}
}
left->next = mid->next;
right->next = NULL;
}
};Code language: PHP (php)

Partition List Leetcode Solution Java

class Solution {
public ListNode partition(ListNode head, int x) {
ListNode left = new ListNode(0);
ListNode right = new ListNode(0);

ListNode leftTail = left;
ListNode rightTail = right;

leftTail = leftTail.next;
}
else{
rightTail = rightTail.next;
}
}

leftTail.next = right.next;
rightTail.next = null;

return left.next;
}
}Code language: PHP (php)

Partition List Leetcode Solution JavaScript

var partition = function(head, x) {
let fdum = new ListNode(0), bdum = new ListNode(0),
front = fdum, back = bdum, curr = head
while (curr) {
if (curr.val < x)front.next = curr, front = curr
else back.next = curr, back = curr
curr = curr.next
}
front.next = bdum.next, back.next = null
return fdum.next
};Code language: JavaScript (javascript)

Partition List Leetcode Solution Python

class Solution(object):
def partition(self, head, x):
h1, h2 = None, None
while n:
if n.val<x:
if h1:
n1.next = n
else:
h1      = n
n1 = n
else:
if h2:
n2.next = n
else:
h2      = n
n2 = n
n = n.next
if h1:
n1.next = h2
if h2:
n2.next = None
return h1 or h2Code language: HTML, XML (xml)
Scroll to Top