Created
June 24, 2014 19:49
-
-
Save iwilbert/c87a88857239e80785c8 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public ListNode partition(ListNode head, int x) { | |
if(head == null || head.next == null) | |
return head; | |
ListNode lessHead, nolessHead, lessCur, nolessCur; | |
lessHead = nolessHead = lessCur = nolessCur = null; | |
ListNode cur, next; | |
cur = head; | |
while(cur != null) { | |
next = cur.next; | |
cur.next = null; // cut off cur node from the list | |
if(cur.val < x) { | |
if(lessHead == null) | |
lessHead = cur; | |
else | |
lessCur.next = cur; | |
lessCur = cur; | |
} else { | |
if(nolessHead == null) | |
nolessHead = cur; | |
else | |
nolessCur.next = cur; | |
nolessCur = cur; | |
} | |
cur = next; | |
} | |
// connect two lists | |
if(lessCur != null) | |
lessCur.next = nolessHead; | |
ListNode newHead; | |
newHead = (lessHead == null) ? nolessHead : lessHead; | |
return newHead; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment