链表分割

题目描述

编写代码，以给定值x为基准将链表分割成两部分，所有小于x的结点排在大于或等于x的结点之前

给定一个链表的头指针 ListNode* pHead，请返回重新排列后的链表的头指针。注意：分割以后保持原来的数据顺序不变。

方法一：

import java.util.*;

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Partition {
    public ListNode partition(ListNode pHead, int x) {
        // write code here
        if(pHead==null) return null;
        ListNode beforeStart = null, beforeEnd = null;
        ListNode afterStart = null, afterEnd = null;
        ListNode node = pHead;
        while(node!=null){
            ListNode t = node.next;
            node.next = null;//拆解原来链
            if(node.val < x){
                if(beforeStart==null){
                    beforeStart = node;
                    beforeEnd = beforeStart;
                }else{
                    beforeEnd.next = node;
                    beforeEnd = beforeEnd.next;
                }
            }else{
                if(afterEnd==null){
                    afterStart = node;
                    afterEnd = afterStart;
                }else{
                    afterEnd.next = node;
                    afterEnd = afterEnd.next;
                }
            }
            node = t; //拆解原来链
        }
        if(beforeStart==null){
            return afterStart;
        }else{
            beforeEnd.next = afterStart;
            return beforeStart;
        }
    }
}

方法二：

import java.util.*;

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Partition {
    public ListNode partition(ListNode pHead, int x) {
        // write code here
        if(pHead==null) return null;
        ListNode beforeStart = null, beforeEnd = null;
        ListNode afterStart = null, afterEnd = null;
        ListNode node = pHead;
        while(node!=null){
            if(node.val < x){
                if(beforeStart==null){
                    beforeStart = new ListNode(node.val); //创建新的链，不影响原来的链
                    beforeEnd = beforeStart;
                }else{
                    beforeEnd.next = new ListNode(node.val);
                    beforeEnd = beforeEnd.next;
                }
            }else{
                if(afterEnd==null){
                    afterStart = new ListNode(node.val);
                    afterEnd = afterStart;
                }else{
                    afterEnd.next = new ListNode(node.val);
                    afterEnd = afterEnd.next;
                }
            }
            node = node.next;
        }
        if(beforeStart==null){
            return afterStart;
        }else{
            beforeEnd.next = afterStart;
            return beforeStart;
        }
    }
}