//向有序环形单链表中插入节点
public class Node{
public int value;
public Node next;
public Node(int data){
this.data=data;
}
}
public Node insertNum(Node head,int num){
Node node=new Node(num);
if(head==null){
node.next=node;
return node
}
Node pre=head;
Node cur=head;
while(cur!=null){
if(pre.value<=num&&cur.value>=num){
break;
}
pre=cur;
cur=cur.next;
}
pre.next=node;
node.next=cur;
return head.value<num?head:node;
}
链表-向有序环形单链表中插入节点
猜你喜欢
转载自blog.csdn.net/weixin_42146769/article/details/88381628
今日推荐
周排行