LeetCode 86. Partition List（链表分区）

原题网址：https://leetcode.com/problems/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; }
 * }
 */
public class Solution {
    public ListNode partition(ListNode head, int x) {
        ListNode less = new ListNode(0);
        ListNode tail = less;
        ListNode current = head;
        ListNode notLess = new ListNode(0);
        ListNode notLessTail = notLess;
        while (current != null) {
            if (current.val < x) {
                tail.next = current;
                current = current.next;
                tail = tail.next;
                tail.next = null;
            } else {
                notLessTail.next = current;
                current = current.next;
                notLessTail = notLessTail.next;
                notLessTail.next = null;
            }
        }
        if (less.next != null) {
            tail.next = notLess.next;
            return less.next;
        }
        return notLess.next;
    }
}

最后

以上就是飘逸荷花为你收集整理的LeetCode 86. Partition List（链表分区）的全部内容，希望文章能够帮你解决LeetCode 86. Partition List（链表分区）所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。