【无标题】

head.h

#ifndef __HEAD_H__
#define __HEAD_H__


#include <stdio.h>


#include <stdlib.h>
#include <string.h>
#define MAXSIZE 12
typedef int datetype;
typedef struct
{    int len;

    //数据元素
    datetype date[MAXSIZE];
    //顺序表长度
}Seqlist;



Seqlist *CreatSPace();
void Output(Seqlist *p);
void DElete(Seqlist *p);
void SeqlistBUll(Seqlist *p);
void Combin(Seqlist *s1,Seqlist *s2,Seqlist *s3);
void Removesame(Seqlist *p);
int SeqlistFUll(Seqlist *p);
int SeqlistEmpy(Seqlist *s);
int Seqlistsearchbydate(Seqlist *p,datetype key);
void Seqlistdele(Seqlist *p,int sub);
void SeqlistBUll(Seqlist *p);
void Seqlistdelebydate(Seqlist*p,datetype key3);
void SeqlistupdateBydate(Seqlist *p,datetype key1,datetype key2);
void SeqlistCHAru(Seqlist *p,int sub2,datetype e2);
void Seqlistsearch(Seqlist *p,int sub);
void InsertByRear(Seqlist *p,datetype e);
void Seqlistxiugai(Seqlist *p,int sub1,datetype e1);
#endif

main.c

#include "head.h"
int main(int argc, const char *argv[])
{
    Seqlist *p=CreatSPace();
    
    if(p==NULL)
        printf("申请失败");
    //===========顺序表在表尾插入==========
    int n;
    datetype e;
    printf("输入插入数据元素的个数");
    scanf("%d",&n);
    if(n>MAXSIZE)
        return 0;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&e);
        InsertByRear(p,e);
    }
    //遍历顺序表

    Output(p);

    //===========顺序表在表尾删除================
    DElete(p);
    printf("删除表尾元素\n");
    Output(p);
    //==============顺序表按下标查找=============
    int sub;//
    printf("输入要查找的下标");
    scanf("%d",&sub);
    Seqlistsearch(p,sub);
    //====================顺序表按下标修改=============================
    int sub1;
    datetype e1;
    printf("\n输入修改的下标");
    scanf("%d",&sub1);
    printf("\n输入要修改的值");
    scanf("%d",&e1);
    Seqlistxiugai(p,sub1,e1);
    //顺序表按下标插入
    int sub2;
    datetype e2;
    printf("\n要插入的下标");
    scanf("%d",&sub2);
    printf("\n要插入的值");
    scanf("%d",&e2);
    SeqlistCHAru(p,sub2,e2);
    //顺序表按下标删除
    int sub3;
    printf("\n要删除的下标");
    scanf("%d",&sub3);
    Seqlistdele(p,sub3);
    //顺序表按元素查找
    datetype key;
    printf("\n输入要查找的元素");
    scanf("%d",&key);
    int sub4=Seqlistsearchbydate(p,key);
    if(sub4==-1)
    {
        printf("查找元素不存在\n");
        }
    else
    printf("%d的位置下标为%d\n",key,sub4);

    //顺序表通过数据元素修改
    datetype key1;
    datetype key2;
    printf("\n请输入要修改的元素");
    scanf("%d",&key1);
    printf("\n请输入修改值");
    scanf("%d",&key2);
    SeqlistupdateBydate(p,key1,key2);
        //顺序表通过数据元素删除
    
    printf("请输入要删除的元素\n");
    scanf("%d",&key);
    Seqlistdelebydate(p,key);

    //去重
    Removesame( p);
    //顺序表排序
    SeqlistBUll(p);
    
    //顺序表有序合并
    Seqlist s1={5,4,5,3,2,1};
    Seqlist s2={7,2,1,5,8,3,1,3};
    Seqlist s3;
    s3.len=0;
    Combin(&s1,&s2,&s3);
    Output(&s3);
    Removesame(&s3);
    Output(&s3);
        return 0;

}

test.c

#include "head.h"

//顺序表在堆区申请空间
Seqlist *CreatSPace()
{
    Seqlist *s=(Seqlist *)malloc(sizeof(Seqlist));
    if(s==NULL)
        return NULL;
    s->len=0;//表示顺序表数据元素的个素为0，顺序表空
    return s;
}

//判断顺序表是否为满
int SeqlistFUll(Seqlist *p)
{    
    if(p->len==MAXSIZE)
        return -1;
    return 0;
}
//顺序表输入
void InsertByRear(Seqlist *p,datetype e)
{
    if(SeqlistFUll(p))
        return;
    p->date[p->len++]=e;
}
//
void Output(Seqlist *p)
{    for(int i=0;i<p->len;i++)
    {

        printf("%d\t",p->date[i]);
    }

}
//判断顺序表是否为空
int SeqlistEmpy(Seqlist *s)
{
    if(s->len==0)
    {    
        return -1;
    }
    return 0;
}
//在尾部删除
void DElete(Seqlist *p)
{
    if(SeqlistEmpy(p))
        return;
    p->len--;
}
//按下标查找
void Seqlistsearch(Seqlist *p,int sub)
{
    if(sub<0||sub>=p->len||SeqlistEmpy(p))
    {    printf("查找失败\n");
        return;
    }
    printf("查找的元素是%d\n",p->date[sub]);
    

}
//按下标修改
void Seqlistxiugai(Seqlist *p,int sub1,datetype e1)
{
    if(sub1<0||sub1>=p->len||SeqlistEmpy(p))
    {    printf("修改失败\n");
        return;
    }
    p->date[sub1]=e1;
    Output(p);
}
//按下标插入
void SeqlistCHAru(Seqlist *p,int sub2,datetype e2)
{
    if(sub2<0||sub2>p->len||SeqlistFUll(p))
    {
        printf("\n插入失败\n");
        return;
    }
    for(int i=p->len-1;i>=sub2;i--)
    {
        p->date[i+1]=p->date[i];
    }
    p->date[sub2]=e2;
    p->len++;
    Output(p);
}
//按下标删除
void Seqlistdele(Seqlist *p,int sub)
{
    if(sub<0||sub>=p->len)
    {
        printf("下标不合法\n");
        return;
    }
    if(SeqlistEmpy(p))
    {
        printf("顺序表为空，无可删除数据元素\n");
        return;
    }
    printf("删除完成，删除下标为%d，值为%d的元素\n",sub,p->date[sub]);

    for(int i=sub;i<=p->len-1;i++)
    {
        p->date[i]=p->date[i+1];
    }
    p->len--;
        
    Output(p);

}
int Seqlistsearchbydate(Seqlist *p,datetype key)
{
    if(SeqlistEmpy(p))
    {
        printf("顺序表为空");
        return -1;
    }
    for(int i=0;i<p->len;i++)
    {
        if(p->date[i]==key)
        {
            return i;
        }
            }
    return -1;
}
void SeqlistupdateBydate(Seqlist *p,datetype key1,datetype key2)
{
    if(SeqlistEmpy(p))
        return;
    int sub=Seqlistsearchbydate(p,key1);
    if(sub==-1)
    {
        printf("%d在顺序表中不存在\n",key1);
        return;
    }
    else
    {
        p->date[sub]=key2;
        Output(p);
    }

}
void Seqlistdelebydate(Seqlist*p,datetype key3)
{
    if(SeqlistEmpy(p))
    {
        return;
    }
    int sub=Seqlistsearchbydate(p,key3);
        if(sub==-1)
        {
            printf("%d在顺序表中不存在",key3);
            return;
        }
    else
    Seqlistdele(p,sub);
}
void Removesame(Seqlist *p)
{
    int i,j;
    for(i=0;i<p->len;i++)
    {
        for(j=i+1;j<p->len;j++)
        {
            if(p->date[i]==p->date[j])
            {
                Seqlistdele(p,j);
                    printf("\n");
                    j--;
            }
        }
    }
    Output(p);
    printf("去重完成\n");
}
void SeqlistBUll(Seqlist *p)
{
    int i=0;
    int j=0;
    int temp=0;
    int count=0;
    for(i=0;i<p->len-1;i++)
    {
        count=0;
        for(j=0;j<p->len-i-1;j++)
        {
            if(p->date[j]>p->date[j+1])
            {
                temp=p->date[j];
                p->date[j]=p->date[j+1];
                p->date[j+1]=temp;
                count++;
            }
        }
        if(count==0)
            break;
    }

}
void Combin(Seqlist *s1,Seqlist *s2,Seqlist *s3)
{
    int i=0;
    int j=0;

    SeqlistBUll(s1);
    SeqlistBUll(s2);
    printf("\n");
    Output(s1);
    printf("\n");
    Output(s2);

    printf("\n");
    while(i<s1->len && j<s2->len && s3->len<MAXSIZE)
    {
        if(s1->date[i]<s2->date[j])
        {
            s3->date[s3->len++]=s1->date[i++];
        }
        else
        {
            s3->date[s3->len++]=s2->date[j++];
        }
    }
    while(i<s1->len&&s3->len<MAXSIZE)
    {
        s3->date[s3->len++]=s1->date[i++];
    }
    while(j<s2->len&&s3->len<MAXSIZE)
    {
        s3->date[s3->len++]=s2->date[j++];
    }
    

}