Node* insert(Node* aNode, int x)
{
if (aNode == NULL)
{
aNode = new Node(x);
aNode->next = aNode;
return aNode;
}
Node *prev = aNode;
Node *p = prev->next;
do
{
if (prev->value <= x && x <= p->value)
{
break;
}
else if (prev->value >= p->value && (x >= prev->value || x <= p->value))
{
break;
}
else
{
prev = p;
p = prev->next;
}
}
while (prev != aNode);
Node *newNode = new Node(x);
newNode->next = prev->next;
prev->next = newNode;
return aNode;
}
向循环有序链表内插入一个节点
最新推荐文章于 2022-06-22 11:48:43 发布