Problem_0708_insert.cc

#include <iostream>
#include <vector>

using namespace std;

class Node
{
 public:
  int val;
  Node *next;

  Node() {}

  Node(int _val)
  {
    val = _val;
    next = NULL;
  }

  Node(int _val, Node *_next)
  {
    val = _val;
    next = _next;
  }
};

class Solution
{
 public:
  Node *insert(Node *head, int insertVal)
  {
    Node *node = new Node(insertVal);
    if (head == nullptr)
    {
      node->next = node;
      return node;
    }
    if (head->next == head)
    {
      head->next = node;
      node->next = head;
      return head;
    }
    Node *cur = head;
    Node *next = head->next;
    while (next != head)
    {
      if (cur->val <= insertVal && insertVal <= next->val)
      {
        break;
      }
      if (cur->val > next->val)
      {
        if (insertVal > cur->val || insertVal < next->val)
        {
          break;
        }
      }
      cur = cur->next;
      next = next->next;
    }
    cur->next = node;
    node->next = next;
    return head;
  }
};