[LeetCode] 708. Insert into a Cyclic Sorted List

最新推荐文章于 2024-10-13 22:34:22 发布

weixin_34128839

最新推荐文章于 2024-10-13 22:34:22 发布

阅读量170

点赞数

CC 4.0 BY-SA版权

原文链接：https://segmentfault.com/a/1190000017139433

本文介绍了一种算法，用于在循环有序链表中插入一个值，保持链表的有序性和循环特性。讨论了不同情况下的插入策略，包括空链表、递增范围、峰值和下降范围以及头部前的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem

Given a node from a cyclic linked list which is sorted in ascending order, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be a reference to any single node in the list, and may not be necessarily the smallest value in the cyclic list.

If there are multiple suitable places for insertion, you may choose any place to insert the new value. After the insertion, the cyclic list should remain sorted.

If the list is empty (i.e., given node is null), you should create a new single cyclic list and return the reference to that single node. Otherwise, you should return the original given node.

The following example may help you understand the problem better:

In the figure above, there is a cyclic sorted list of three elements. You are given a reference to the node with value 3, and we need to insert 2 into the list.

The new node should insert between node 1 and node 3. After the insertion, the list should look like this, and we should still return node 3.

Solution

/*
// Definition for a Node.
class Node {
    public int val;
    public Node next;

    public Node() {}

    public Node(int _val,Node _next) {
        val = _val;
        next = _next;
    }
};
*/
class Solution {
    public Node insert(Node head, int insertVal) {
        if (head == null) {
            head = new Node();
            head.val = insertVal;
            head.next = head;
            return head;
        }
        Node next = head.next, pre = head;
        while (next != head) {
            //insert in flat or rising range
            if (pre.val == insertVal || (pre.val < insertVal && insertVal < next.val)) {
                Node cur = new Node(insertVal, next);
                pre.next = cur;
                return head;
            }
            //insert in peak and falling range
            if (pre.val > next.val && (insertVal < next.val || insertVal > pre.val)) {
                Node cur = new Node(insertVal, next);
                pre.next = cur;
                return head;
            }
            
            pre = next;
            next = next.next;
        }
        //insert before head
        Node cur = new Node(insertVal, next);
        pre.next = cur;

        return head;
    }
}