[LeetCode-JAVA] Partition List

標籤：

題目：

Given 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.

For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.

 

思路：找出以x為劃分的兩段鏈表，並串連在一起，注意維護鏈表頭。

 

代碼：

public class Solution {    public ListNode partition(ListNode head, int x) {                ListNode small = new ListNode(0);  //兩個新鏈表        ListNode big = new ListNode(0);                  ListNode smallTemp = small;   //儲存鏈表頭        ListNode bigTemp = big;                while(head!=null){            if(head.val < x){                big.next = head;                big = big.next;            }else{                small.next = head;                small = small.next;            }            head = head.next;        }        big.next = smallTemp.next;   //串連        small.next = null;                return bigTemp.next;    }}    

 

[LeetCode-JAVA] Partition List