C语言 数据结构实训1（链表及顺序表去重、链表逆置、链表合并、插入排序）

一、链表及顺序表去重

（1）链表去重

//链表去重 
#include <stdio.h>
#include <stdlib.h>
#define null 0
typedef struct node{
    int data;
    struct node *next; 
}Sqlist;
Sqlist *CreateList(){
    Sqlist *head,*q,*p;
    int a[15]={2,3,5,5,6,65,6,5,12,6,23,65,3,12,3};
    head=(Sqlist *)malloc(sizeof(Sqlist));
    q=head;
    for(int i=0;i<15;i++){
        p=(Sqlist *)malloc(sizeof(Sqlist));
        p->data=a[i];
        q->next=p;
        q=p;
    }
    q->next=null;
    return head;
}
void DispList(Sqlist *l){
    Sqlist *q;
    q=l->next;
    while(q!=null){
        printf("%d ",q->data);
        q=q->next;
    }
    printf("\n");
}
int main(){
    Sqlist *l,*r,*p,*s;
    l=CreateList();
    printf("单链表去重：\n");
    printf("（1）创建一个链表：\n");
    DispList(l);
    p=l->next;
    while(p!=null){
        r=p->next;
        s=p;
        while(r!=null){
            if(p->data==r->data){
                s->next=r->next;
            }else{
                s=s->next;
            }
            r=r->next;
        }
        p=p->next;
    }
    printf("（2）去除结点数据域相同的结点：\n");
    DispList(l);
}

（2）顺序表去重

//顺序表去重 
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define null 0
#define MAXSIZE 100
typedef struct{
    int data[MAXSIZE];
    int length; 
}Sqlist;
void CreateList(Sqlist *l,int a[],int n){
    int i;
    for(i=0;i<n;i++){
        l->data[i]=a[i];
    }
    l->length=n;
} 
bool ListDelete(Sqlist *l,int i){
    if(l->length==0)return false;
    int j;
    for(i=i-1;i<l->length-1;i++)
    l->data[i]=l->data[i+1];
    l->length--;
    return true;
}

void Displist(Sqlist *l){
    int i,j;
    i=l->length;
    for(j=0;j<i-1;j++)printf("%d ",l->data[j]);
    printf("\n");
} 
int main(){
    Sqlist *l;
    int a[15]={2,3,12,2,3,12,5,7,3,12,3,22,12,56,19};
    l=(Sqlist *)malloc(sizeof(Sqlist));
    printf("顺序表去重：\n");
    printf("（1）创建一个顺序表\n");
    CreateList(l,a,15);
    Displist(l);
    int i,j,flag;
    j=0;
    while(j!=l->length){
        i=j+1;
        flag=j+2;
        while(i!=l->length){
            if(l->data[i]==l->data[j]){
                ListDelete(l,flag);
                flag++;
                i++;
            }else{
                flag++;
                i++;
            }
        }
        j++;
    }
    printf("（2）输出去重后的顺序表：\n");
    Displist(l);
}

 

二、链表逆置

//单链表逆置，原链表进行 
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define null 0
typedef struct node{
    int data;
    struct node *next;
}Sqlist;
Sqlist *CreateList(){
    Sqlist *head,*q,*p;
    int a[10]={1,2,3,4,5,6,7,8,9,10};
    head=(Sqlist *)malloc(sizeof(Sqlist));
    q=head;
    for(int i=0;i<10;i++){
        p=(Sqlist *)malloc(sizeof(Sqlist));
        p->data=a[i];
        q->next=p;
        q=p;
    }
    q->next=null;
    return head;
}
void DispList(Sqlist *l){
    Sqlist *q;
    q=l->next;
    while(q!=null){
        printf("%d ",q->data);
        q=q->next;
    }
    printf("\n");
}
void ReverseList(Sqlist *l){
    Sqlist *pre,*cur,*aft;
    pre=null;
    cur=l->next;
    while(cur!=null){
        aft=cur->next;
        cur->next=pre;
        pre=cur;
        cur=aft;
    }
    l->next=pre;
}

int main(){
    Sqlist *l,*p,*r;
    printf("单链表逆置：\n");
    printf("（1）创建一个单链表：\n");
    l=CreateList();
    DispList(l);
    ReverseList(l);
    printf("（2）反转这个单链表：\n");
    DispList(l);
}

 

三、链表合并

/*链表合并*/ 
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define null 0
typedef struct node{
    int data;
    struct node *next;
}Sqlist;
Sqlist *CreateList(int a[],int n){
    Sqlist *head,*q,*p;
    head=(Sqlist *)malloc(sizeof(Sqlist));
    q=head;
    for(int i=0;i<n;i++){
        p=(Sqlist *)malloc(sizeof(Sqlist));
        p->data=a[i];
        q->next=p;
        q=p;
    }
    q->next=null;
    return head;
}
void DispList(Sqlist *l){
    Sqlist *q;
    q=l->next;
    while(q!=null){
        printf("%d ",q->data);
        q=q->next;
    }
    printf("\n");
}
int main(){
    Sqlist *s,*t,*p,*q,*r,*w;
    int a[6]={2,3,4,1,7,9};
    int b[8]={4,6,12,55,23,17,10,22};
    s=CreateList(a,6);
    t=CreateList(b,8);
    printf("创建两个链表:\n");
    DispList(s);
    DispList(t);
    Sqlist *l;
    l=(Sqlist *)malloc(sizeof(Sqlist));
    r=l;
    p=t->next;
    q=s->next;
    while(p!=null && q!=null){
        w=p->next;
        r->next=p;
        p->next=q;
        r=q;
        p=w;
        q=q->next;
    }
    if(p!=null)r->next=p;
    else if(q!=null)r->next=q;
    printf("输出合并后的链表：\n");
    DispList(l);
} 

 

四、插入排序

//插入一个元素，使线性表仍非递减有序 ---单链表 
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define null 0
typedef struct node{
    int data;
    struct node *next;
}Sqlist;
Sqlist *CreateList(int a[],int n){
    Sqlist *head,*q,*p;
    head=(Sqlist *)malloc(sizeof(Sqlist));
    q=head;
    for(int i=0;i<n;i++){
        p=(Sqlist *)malloc(sizeof(Sqlist));
        p->data=a[i];
        q->next=p;
        q=p;
    }
    q->next=null;
    return head;
}
void DispList(Sqlist *l){
    Sqlist *q;
    q=l->next;
    while(q!=null){
        printf("%d ",q->data);
        q=q->next;
    }
    printf("\n");
} 
int main(){
    Sqlist *l;
    int m;
    int a[10]={5,7,8,10,14,17,21,22,26,33};
    l=CreateList(a,10);
    printf("插入排序：\n");
    printf("（1）创建一个递增链表：\n");
    DispList(l);
    printf("请输入要插入的数：");
    scanf("%d",&m);
    Sqlist *p,*r,*q;
    p=l;
    while(p!=null){
        q=p->next;
        if(q==null){
            r=(Sqlist *)malloc(sizeof(Sqlist));
            r->data=m;
            p->next=r;
            r->next=null;
            break;
        }        
        if(q->data>m){
            r=(Sqlist *)malloc(sizeof(Sqlist));
            r->data=m;
            p->next=r;
            r->next=q;
            break;
        }else{
            p=p->next;
        }
    } 
    printf("（2）插入新节点得链表：\n");
    DispList(l);
}