#include"head_node.h"

/**********************************/
/*         删除重复               */
/**********************************/

void Delete_Repeat_Node(node *head)
{
    node *p,*pre,*s;
    pre=head->next;
    p=pre->next;
    while(p)
    {
        s=p->next;
        while(s&&s->info!=p->info)
        {
            s=s->next;
        }
        if(s)
        {
            pre->next=p->next;
            free(p);
            p=pre->next;
        }
        else
        {
            pre=p;
            p=p->next;
        }
    }
}

int main()
{
    node *head;
    head=Creat_Node();
    Print_Node(head);
    Delete_Repeat_Node(head);
    Print_Node(head);
    return 0;
}

#include"Head_Node.h"
/************************************/
/*           在Y前插入X             */
/************************************/
void Before_y_Insert_x(node* head,int y,int x)
{
    node *pre,*p,*s;
    pre=head;
    p=pre->next;
    while(p&&p->info!=y)
    {
        pre=p;
        p=p->next;
    }
    if(p==NULL)
    {
        printf("error!%d不在该链表中/n",y);
    }
    else
    {
        s=(node*)malloc(sizeof(node));
        s->info=x;
        s->next=p;
        pre->next=s;
    }
}

int main()
{
    node *head;
    int x,y;
    head=Creat_Node();
    printf("在y前插入x，输入y,x:");
    scanf("%d%d",&y,&x);
    Print_Node(head);
    Before_y_Insert_x(head,y,x);
    Print_Node(head);
    return 0;
}

 2/2   首页 上一页 1 2