LeetCode-Partition List

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/24017881

时间：2014-8-19

题目

Partition List

  Total Accepted: 8519  Total Submissions: 32497 My Submissions

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.

解法

这里要注意一下p2指针的next一直没有设置为null，会有超时的异常。

/**
 * 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) {
        ListNode dummy =  new ListNode(Integer.MIN_VALUE);
        ListNode p1 = dummy;
        ListNode dummy2 = new ListNode(Integer.MAX_VALUE);
        ListNode p2 = dummy2;
        if(head == null || head.next ==null)
            return head;
        while(head != null){
            if(head.val < x){
                p1.next = head;
                p1 = p1.next;
                
            }
            else{
                p2.next = head;
                p2 = p2.next;
            }
            head = head.next;
        }
        p2.next =null;
        p1.next = dummy2.next;
        return dummy.next;
    }
}

返回

LeetCode Solution(持续更新，java>c++)