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.

• 思路
  给定一个链表和一个值，以该值为界把链表分割成两部分且原始相对位置不变。
  定义两个链表，遍历原链表，当小于的时候第一个链表连接并后移，反正第二个链表连接并后移。最后连接两个链表(注意最后加上结束的标记)

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode partition(ListNode head, int x) {
        if(head == null)
            return head;
        
        ListNode first = new ListNode(0);
        ListNode sec = new ListNode(0);
        //保留头结点
        ListNode firstTemp = first; 
        ListNode secTemp = sec;
        
        while(head != null){
            
            if(head.val < x){
                first.next = head;
                first = first.next;
            }else{
                sec.next = head;
                sec = sec.next;
            }
            
            head = head.next;
        }
        
        //连接链表，最后标记结束
        first.next = secTemp.next;
        sec.next = null;
        
        return firstTemp.next;
    }
}