码迷,mamicode.com
首页 > 其他好文 > 详细

Partition List

时间:2014-06-11 06:28:41      阅读:364      评论:0      收藏:0      [点我收藏+]

标签:leetcode   链表   java   

题目

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.

方法

将原来的Linked List 拆分成两个, 一个记录比X小的元素,另一个记录比X大的元素,最后将其合并。
    public ListNode partition(ListNode head, int x) {
        ListNode lessStart = null;
        ListNode lessEnd = null;
        ListNode greaterStart = null;
        ListNode greaterEnd = null;
        ListNode cur = head;
        while (cur != null) {
            if (cur.val < x) {
                if (lessStart == null) {
                    lessStart = cur;
                    lessEnd = cur;
                } else {
                    lessEnd.next = cur;
                    lessEnd = cur;
                }
            } else {
                if (greaterStart == null) {
                    greaterStart = cur;
                    greaterEnd = cur;
                } else {
                    greaterEnd.next = cur;
                    greaterEnd = cur;
                }
            }
            cur = cur.next;
        }
        if (lessStart == null) {
            return greaterStart;
        }
        if (greaterStart == null) {
            return lessStart;
        }
        greaterEnd.next = null;
        lessEnd.next = greaterStart;
        return lessStart;
    }


Partition List,布布扣,bubuko.com

Partition List

标签:leetcode   链表   java   

原文地址:http://blog.csdn.net/u010378705/article/details/29359943

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!