顺序表的基本运算 -- 线性表

C语言实现顺序表的插入、删除、查找运算

/*
 *实现顺序表的插入、删除、查找运算
 */

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>

#define MaxSize 20
typedef int ElemType;

typedef struct SeqList
{            //线性表顺序存储结构定义
    ElemType elem[MaxSize];        //存放顺序表数据元素
    int length;        //当前长度
}SeqList;            //线性表顺序存储结构类型名

int Init_SeqList(SeqList &L)    //初始化
{
    L.length = 0;
    return 1;
}

int Locate_SeqList(SeqList &L,int x)    //查找
{
    int i = 0;        //i为扫描指示器
    while(i < L.length  &&  L.elem[i] != x) //顺序扫描直至找到等于给定值的元素或表尾
        i ++;
    if(i >= L.length)
    {
        printf("The sequence table does not exist for the element!\n");
        return 0;
    }
    else
        return i + 1;
}

int Insert_SeqList(SeqList &L, int i, int x)        //在第i个元素前插入新元素
{
    int j;
    if (L.length >= MaxSize)        //L.length是最后一个元素的位置
    {
        printf("The sequence table is full and can not be inserted!");
        return 0;
    }
    if (i <= 0 || i > L.length+1)
    {
        printf("The insertion position is incorrect!");
        return 0;
    }
    for (j = L.length-1; j >= i - 1; j --)
    {
        L.elem[j + 1] = L.elem[j];        //元素右移
    }
    L.elem[i-1] = x;    //插入新元素x
    L.length++;            //完成插入，表长增一
    return 1;
}

int Delete_SeqList(SeqList &L, int i)        //删除第i个元素
{
    int j;
    if (i < 1 || i > L.length)
    {
        printf("Delete location is incorrect!");
        return 0;
    }
    for (j = i; j < L.length; j++)
    {
        L.elem[j-1] = L.elem[j];        //元素左移
    }
    L.length --;        //完成删除，表长减一
    return 1;
}

int Display_SeqList(SeqList &L)
{
    int i;
    for (i = 0; i < L.length; i++)
        printf("%d ",L.elem[i]);
    return 1;
}

int main()
{
    SeqList L;
    ElemType e,x;
    int i=1,k,j;
    Init_SeqList(L);
    printf("Initialization!\nThe sequence table elements are as follows\n");
    Insert_SeqList(L,1,520);
    Insert_SeqList(L,2,1314);
    Insert_SeqList(L,3,4399);
    Insert_SeqList(L,4,8888);
    Insert_SeqList(L,5,215);
    Insert_SeqList(L,6,222);
    Display_SeqList(L);
    printf("\n");
    while (i < 3)
    {
        printf("\n             Main Menu            \n");
        printf("\n     1    Find the specified element         \n");
        printf("\n     2    Inert the element to the specified location        \n");
        printf("\n     3    Delete the specified location element         \n");
        printf("\n     4    Exit the problem     \n");
        printf("---------------------------------------------------------------------\n");
        printf("Please enter the menu number you want to select<1,2,3,4>:\n");
        scanf("%d",&i);
        switch(i)
        {
            case 1:
                printf("Please enter the search element: \n");
                scanf("%d",&x);
                j = Locate_SeqList(L,x);
                if (j != 0)
                    printf("The specified element location is: %d\n",j);
                break;
            case 2:
                printf("Please enter the location of the inserted element: \n");
                scanf("%d",&k);
                printf("Please enter the value of the inserted element: \n");
                scanf("%d",&x);
                j = Insert_SeqList(L,k,x);
                if (j != 0)
                {
                    printf("The sequence table after insertion is hown below\n");
                    Display_SeqList(L);
                    printf("\n");
                }
                break;
            case 3:
                printf("Please enter the delete location: ");
                scanf("%d",&k);
                j = Delete_SeqList(L,k);
                if (j != 0)
                {
                    printf("The deleted sequence table is shown below\n");
                    Display_SeqList(L);
                    printf("\n");
                }
                break;
            case 0:
                exit(0);
                break;
            default :
                printf("Incorrect input!");
        }
    }
}

 结果运行截图