头文件:
#ifndef __SEQLIST_H__
#define __SEQLIST_H__
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#define MAX 10
typedef int DataType;
typedef struct SeqList
{
DataType data[MAX];
int sz;
}SeqList, *pSeqList;
void InitSeqList(pSeqList ps);//初始化
void PushBack(pSeqList ps, DataType d);//从尾部添加元素
void PopBack(pSeqList ps);//从尾部删除元素
void Display(const pSeqList ps);//打印函数
void PushFront(pSeqList ps, DataType d);//从头部添加元素
void PopFront(pSeqList ps);//从头部删除元素
int Find(pSeqList ps, DataType d);
void Insert(pSeqList ps, DataType d, int pos);//在指定位置插入元素
void Remove(pSeqList ps, DataType d);//删除指定元素的第一次出现
void RemoveAll(pSeqList ps, DataType d);//删除指定元素的所有出现
void Reverse(pSeqList ps);//逆序
void Sort(pSeqList ps);//排序
int BinarySearch(pSeqList ps, DataType d);//二分查找元素
void meau(void);
#endif //__SEQLIST_H__
源文件:
#define _CRT_SECURE_NO_WARNINGS
#include"seqlist.h"
int main()
{
SeqList ps;
int input = 0;
DataType d = 0;
int pos = 0;
do
{
meau();
scanf("%d", &input);
switch (input)
{
case 1:
InitSeqList(&ps);
break;
case 3:
PushFront(&ps, d);
break;
case 4:
PopFront(&ps);
break;
case 5:
PushBack(&ps, d);
break;
case 6:
PopBack(&ps);
break;
case 2:
Display(&ps);
break;
case 7:
Insert(&ps, d, pos);
break;
case 8:
Remove(&ps, d);
break;
case 9:
RemoveAll(&ps, d);
break;
case 10:
Reverse(&ps);
break;
case 11:
Sort(&ps);
break;
case 12:
printf("%d\n", BinarySearch(&ps, d) - 1);
break;
default:printf("此选项不存在,请重新输入\n");
break;
}
} while (input);
return 0;
}
void InitSeqList(pSeqList ps)//初始化
{
ps->sz = 0;
}
void PushBack(pSeqList ps, DataType d)//从尾部添加元素
{
printf("输入你要添加的元素:");
scanf("%d", &d);
ps->data[ps->sz] = d;
ps->sz++;
printf("\n");
}
void PopBack(pSeqList ps)//从尾部删除元素
{
ps->sz--;
}
void Display(const pSeqList ps)//打印函数
{
int i = 0;
for (i = 0; i < ps->sz; i++)
{
printf("%d ", ps->data[i]);
}
printf("\n");
}
void PushFront(pSeqList ps, DataType d)//从头部添加元素
{
printf("请输入你要添加的元素:");
scanf("%d", &d);
int i = ps->sz;
for (i = ps->sz; i > 0; i--)
{
ps->data[i] = ps->data[i - 1];
}
ps->data[0] = d;
ps->sz++;
printf("\n");
}
void PopFront(pSeqList ps)//从头部删除元素
{
int i = 0;
for (i = 0; i < ps->sz; i++)
{
ps->data[i] = ps->data[i + 1];
}
ps->sz--;
printf("\n");
}
void Insert(pSeqList ps, DataType d, int pos)//在指定位置插入元素
{
printf("请输入要插入的位置:");
scanf("%d", &pos);
printf("请输入要插入的元素:");
scanf("%d", &d);
int i = ps->sz;
for (i = ps->sz; i > pos - 1; i--)
{
ps->data[i] = ps->data[i - 1];
}
ps->data[pos - 1] = d;
ps->sz++;
printf("\n");
}
void Remove(pSeqList ps, DataType d)//删除指定元素的第一次出现
{
printf("请输入你要删除的元素:");
scanf("%d", &d);
int i = 0;
int j = 0;
for (i = 0; i < ps->sz; i++)
{
if (ps->data[i] == d)
{
for (j = i; j < ps->sz; j++)
{
ps->data[j] = ps->data[j + 1];
}
break;
}
}
ps->sz--;
printf("\n");
}
void RemoveAll(pSeqList ps, DataType d)//删除指定元素的所有出现
{
printf("请输入你要删除的元素:");
scanf("%d", &d);
int i = 0;
int j = 0;
int n = 0;
for (i = 0; i < ps->sz; i++)
{
if (ps->data[i] == d)
{
for (j = i; j < ps->sz; j++)
{
ps->data[j] = ps->data[j + 1];
}
n++;
i--;
}
}
ps->sz -= n;
printf("\n");
}
void Reverse(pSeqList ps)//逆序
{
int left = 0;
int right = (ps->sz) - 1;
while (left < right)
{
int tmp = ps->data[left];
ps->data[left] = ps->data[right];
ps->data[right] = tmp;
left++;
right--;
}
printf("\n");
}
void Sort(pSeqList ps)//排序
{
int i = 0;
int j = 0;
for (i = 0; i < ps->sz - 1; i++)
{
for (j = 0; j < (ps->sz) - i - 1; j++)
{
if ((ps->data[j])>(ps->data[j + 1]))
{
int tmp = ps->data[j];
ps->data[j] = ps->data[j + 1];
ps->data[j + 1] = tmp;
}
}
}
printf("\n");
}
int BinarySearch(pSeqList ps, DataType d)//二分查找元素
{
printf("请输入你要查找的元素:");
scanf("%d", &d);
int left = 0;
int right = (ps->sz) - 1;
while (left < right)
{
int mid = left + (right - left) / 2;
if (ps->data[mid] = d)
{
return mid + 1;
}
else if (ps->data[mid]>d)
{
right = mid - 1;
}
else
{
left = mid + 1;
}
}
return -1;
}
void meau()
{
printf("=========================================\n");
printf(" 1.初始化 2.显示顺序表 \n");
printf(" 3.从头部添加 4.从头部删除 \n");
printf(" 5.从尾部添加 6.从尾部删除 \n");
printf(" 7.在指定位置插入元素 \n");
printf(" 8.删除指定元素第一次出现 \n");
printf(" 9.删除指定元素所有的出现 \n");
printf(" 10.逆序 11.排序 \n");
printf(" 12.二分查找一个元素 \n");
printf("=========================================\n");
}