[LeetCode] Valid Sudoku Partition List

最新推荐文章于 2022-07-05 20:16:22 发布

boegkpmlkvebevwa

最新推荐文章于 2022-07-05 20:16:22 发布

阅读量326

点赞数

分类专栏： Sorting Array 文章标签： Array Sorting

本文链接：https://blog.csdn.net/u014425050/article/details/39004971

版权

Array 同时被 2 个专栏收录

15 篇文章 0 订阅

订阅专栏

Sorting

2 篇文章 0 订阅

订阅专栏

本文介绍了一种链表分区算法，该算法确保所有小于给定值x的节点位于大于或等于x的节点之前，并保持各分区中节点的原始相对顺序不变。例如，对于链表1->4->3->2->5->2和x=3，算法返回1->2->2->4->3->5。

摘要由CSDN通过智能技术生成

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 {
    /**
     *  Create a new list (list1), insert node into the new list if
     *  its val < x, then concat list to the tail of list1.
     * /
    public ListNode partition(ListNode head, int x) {
        if (head == null) return head;
        
        ListNode head1;
        ListNode tail1;
        ListNode head2;
        ListNode node;
        ListNode pre;
        
        // Create new head for list1
        head1 = new ListNode(0);
        tail1 = head1;
        
        // Create new head for list2
        head2 = new ListNode(0);
        pre = head2;
        pre.next = head;
        node = head;
        
        while (node != null) {
            if (node.val < x) {
                // insert node to the list 1 
                tail1.next = node;
                tail1 = node;
                
                pre.next = node.next;
                node = node.next;
            } else {
                pre = node;
                node = node.next;
            }
        }
        
        tail1.next = head2.next;
        
        return head1.next;
    }
}