摘要：
1.创建链表2.插入节点node *intsert(node *head,int num){node *p0,*p1,*p2;p1=head;p0=(node *)malloc(sizeof(node));p0->data=num;while(p0->data>p1->data&&p1->next!=NULL){p2=p1;//将前节点存放起来p1=p1->next;}if(p0->datadata){if(p1==head){p0->next=p1;head=head;}else{p2->next=p0;p0->ne 阅读全文
