head和source文件名是乱取的,可别这样
main.cpp
#include <iostream>
#include"wqdhead.h"
using namespace std;
int main()
{
SeqList mylist;
InitSeqList(&mylist);
SeqList mylist2;
InitSeqList(&mylist2);
int pos;
ElemType Item;
int select=1;
while(select)
{
printf("-------------------顺序表基本操作---------------------\n");
printf("--[1]前端插入----------------------[2]后端插入--------\n");
printf("--[3]显示数据----------------------[4]显示顺序表长度--\n");
printf("--[5]前端删除----------------------[6]后端删除--------\n");
printf("--[7]按位置插入元素----------------[8]按位置删除元素--\n");
printf("--[9]查找元素在顺序表中的位置------[10]排序-----------\n");
printf("--[11]逆置顺序表-------------------[12]获取元素-------\n");
printf("--[13]清空顺序表-------------------[14]销毁顺序-------\n");
printf("\n");
printf("请选择>>>>>>>\n");
scanf("%d",&select);
if(select==0)
{
break;
}
switch(select)
{
case 1:
printf("输入数据,-1为结束标记\n");
scanf("%d",&Item);
while(Item!=-1)
{
push_front(&mylist,Item);
scanf("%d",&Item);
}
break;
case 2:
printf("输入数据,-1为结束标记\n");
scanf("%d",&Item);
while(Item!=-1)
{
push_back(&mylist,Item);
scanf("%d",&Item);
}
break;
case 3:
ShowSeqList(&mylist);
break;
case 4:
printf("线性表长度为:%d\n",Length(&mylist));
break;
case 5:
pop_front(&mylist);
break;
case 6:
pop_back(&mylist);
break;
case 7:
printf("输入要插入元素的位置:\n");
scanf("%d",&pos);
printf("输入要插入元素的值:\n");
scanf("%d",&Item);
InsertSeqList_pos(&mylist,pos,Item);
break;
case 8:
printf("输入要删除元素的位置:\n");
scanf("%d",&pos);
DeleteSeqList_pos(&mylist,pos);
break;
case 9:
printf("输入要查找元素的值:\n");
scanf("%d",&Item);
printf("查找元素在线性表中的位置:%d\n",findSeqList_val(&mylist,Item));
break;
case 10:
sortSeqList(&mylist);
break;
case 11:
reverseList(&mylist);
break;
case 12:
printf("输入要查找元素的值:\n");
scanf("%d",&pos);
GetElem(&mylist,pos,&Item);
printf("位置为%d的元素为:%d\n",pos,Item);
break;
case 13:
clearSeqList(&mylist);
break;
case 14:
DestroySeqList(&mylist);
break;
default:
printf("输入选项不符合要求,请重新输入!\n");
break;
}
}
return 0;
}
wqdhead.h
#ifndef WQDHEAD_H_INCLUDED
#define WQDHEAD_H_INCLUDED
#include <stdio.h>
#include <malloc.h>
#include <assert.h>
#define InitSize 8 /*初始分配的顺序表长度*/
#define IncrSize 4 /*溢出时,顺序表长度的增量*/
typedef int ElemType;
typedef struct SeqList //动态方式定义顺序表存储结构
{
ElemType *data; /*存储空间的基地址*/
int length; /*线性表中有效元素的长度*/
int capacity; //顺序表的容量
}SeqList;
void InitSeqList(SeqList *list);//初始化顺序表
bool IncSeqList(SeqList *list);// 为顺序表增加存储空间
void push_front(SeqList *list,ElemType x);//顺序表前端插入数据
void push_back(SeqList *list,ElemType x);//顺序表后端插入数据
void ShowSeqList(SeqList *list);//显示数据
int Length(SeqList *list);//求顺序表长度
void pop_front(SeqList *list);//前端删除元素
void pop_back(SeqList *list);//后端删除元素
void InsertSeqList_pos(SeqList *list,int pos,ElemType key);//在顺序表中按照pos位置插入数据元素key
void DeleteSeqList_pos(SeqList *list,int pos);//在顺序表中按照pos位置删除数据元素
int findSeqList_val(SeqList *list,ElemType key);/*在顺序表中查找值为key的元素位置*/
void sortSeqList(SeqList *list);//排序
void reverseList(SeqList *list);//逆置
void GetElem(SeqList *list,int pos,ElemType *elem);/*获取指定位置的元素,ingredients将元素存在elem所指空间的变量中*/
void clearSeqList(SeqList *list);//清空顺序表;
void DestroySeqList(SeqList *list);//销毁
#endif // WHEAD_H_INCLUDED
zsbjbhl.cpp
#include"wqdhead.h"
void InitSeqList(SeqList *list)
{
list->data=(ElemType *)malloc(sizeof(ElemType)*InitSize);
assert(list->data!=NULL);
list->length=0;
list->capacity=InitSize;
}
bool IncSeqList(SeqList *list)
{
ElemType *newdata=(ElemType *)realloc(list->data,sizeof(ElemType)*(list->capacity+IncrSize));
if(newdata == NULL)
{
printf("增加空间失败,内存空间已满!\n");
return false;
}
else
{
list->data=newdata;
list->capacity +=IncrSize;
return true;
}
}
void push_front(SeqList *list,ElemType x)
{
if(list->length >= list->capacity && !IncSeqList(list))
{
printf("顺序表空间已满!\n");
return;
}
int i;
for((i=list->length);i>=1;i--)
{
list->data[i]=list->data[i-1];
}
list->data[0]=x;
list->length++;
}
void push_back(SeqList *list,ElemType x)
{
if(list->length >= list->capacity && !IncSeqList(list))
{
printf("顺序表空间已满!\n");
return;
}
list->data[list->length]=x;
list->length++;
// list->data[list->length]=x;
// list->length++;
}
void ShowSeqList(SeqList *list)
{
int i;
for(i=0;i<(list->length);i++)
{
printf("%d ",list->data[i]);
}
printf("\n");
}
int Length(SeqList *list)
{
return list->length;
}
void pop_front(SeqList *list)
{
if(list->length==0)
{
printf("顺序表中没有元素。\n");
return;
}
int i;
for(i=1;i<list->length;i++)
{
list->data[i-1]=list->data[i];//第二个开始前移
}
list->length--;
}
void pop_back(SeqList *list)
{
if(list->length==0)
{
printf("顺序表中没有元素。\n");
return;
}
list->length--;
}
void InsertSeqList_pos(SeqList *list,int pos,ElemType key)
{
if(list->length>=list->capacity && !IncSeqList(list))
{
printf("FULL!\n");
return ;
}
if(pos>list->length || pos<1)
{
printf("输入位置不合法,重新输入! \n");
return;
}
int i;
for(i=list->length;i>=pos;i--)
{
list->data[i]=list->data[i-1];
}
list->data[pos-1]=key;
list->length++;
}
void DeleteSeqList_pos(SeqList *list,int pos)
{
if(list->length>=list->capacity && !IncSeqList(list))
{
printf("FULL!\n");
return ;
}
if(pos>list->length || pos<1)
{
printf("输入位置不合法,重新输入! \n");
return;
}
for(int i=pos-1;i<list->length-1;i++)
{
list->data[i]=list->data[i+1];
}
list->length--;
}
int findSeqList_val(SeqList *list,ElemType key)
{
for(int i=0;i<list->length;i++)
{
if(list->data[i]==key)
return i+1;
}
return -1;//找不到,返回-1
}
void sortSeqList(SeqList *list)//冒泡排序;n个元素,排n-1次,每次两两比较次数n-i
{
//由小到大排列
int i,j;
ElemType temp;
for(i=1;i<list->length;i++)
for(j=0;j<list->length-i;j++)
{
if(list->data[j]>list->data[j+1])
{
temp=list->data[j];
list->data[j]=list->data[j+1];
list->data[j+1]=temp;
}
}
}
void reverseList(SeqList *list)
{
int i=0,temp,a=list->length;
if((list->length)%2==0)
while ((i)*2!=list->length)
{
temp=list->data[i];
list->data[i]=list->data[a-1];
list->data[a-1]=temp;
a--;
i++;
}else
while((i)*2+1!=list->length)
{
temp=list->data[i];
list->data[i]=list->data[a-1];
list->data[a-1]=temp;
a--;
i++;
}
}
void GetElem(SeqList *list,int pos,ElemType *elem)
{
if(pos<0 || pos>=list->length)
{
printf("位置非法,重新制定!");
return;
}
*elem=list->data[pos-1];
}
void clearSeqList(SeqList *list)
{
list->length=0;
}
void DestroySeqList(SeqList *list)
{
free(list->data);
list->data=NULL;
list->length=0;
list->capacity=0;
}