Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
40 lines (38 loc) · 1.04 KB

File metadata and controls

40 lines (38 loc) · 1.04 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package leetcode._86_;
import leetcode.common.ListNode;
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode partition(ListNode head, int x) {
if (head == null || head.next == null) {
return head;
}
ListNode fakeHeader = new ListNode(0);
fakeHeader.next = head;
ListNode curr = fakeHeader;
ListNode cutPoint = null;
while (curr.next != null) {
if (curr.next.val >= x) {
if (cutPoint == null) {
cutPoint = curr;
}
curr = curr.next;
} else if (cutPoint != null) {
ListNode node = curr.next;
curr.next = node.next;
node.next = cutPoint.next;
cutPoint.next = node;
cutPoint = node;
} else {
curr = curr.next;
}
}
return fakeHeader.next;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.