顺序表
头文件:
Utili.h
#ifndef __UTILI_H__
#define __UTILI_H__
#include<iostream>
using namespace std;
#endif
SeqList.h
#ifndef __SEQLIST_H__
#define __SEQLIST_H__
#include"Utili.h"
#include<assert.h>
#define ElemType int
#define SEQLIST_DEFAULT_SIZE 8
typedef struct SeqList
{
ElemType *base;//线性表存储空间申请之后的地址存入base
size_t capacity;//无符号整形size_t 这里是定义了线性表整个空间的容量 比方说我现在capacity=8,就是有8个空间容量
size_t len;//这里是定义了线性表的长度,长度<=空间的容量,即我有多少个数据,长度就为多少,但是不一定我的数据填满了整个空间
}SeqList;
//////////////////////////////////////////////////////////////////////////////////////////
void InitSeqList(SeqList* list);
bool push_back(SeqList *list,ElemType x);
bool show_list(SeqList *list);
bool push_front(SeqList *list,ElemType x);
bool insert_pos(SeqList *list,int pos,ElemType x);
bool pop_back(SeqList *list);
bool pop_front(SeqList *list);
bool insert_val(SeqList *list,ElemType x);
bool delete_pos(SeqList *list,int pos);
bool delete_val(SeqList *list,ElemType key);
int find_key(SeqList *list,ElemType key);
void reverse_list(SeqList *list);
void sort(SeqList *list);
void clear_list(SeqList *list);
void destory_list(SeqList *list);
/////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////
void Swap(ElemType &a,ElemType &b)
{
ElemType tmp = a;
a = b;
b = tmp;
}
////////////////////////////////////////////////////////////////////////////////////////
void InitSeqList(SeqList *list){
list->base = (ElemType*)malloc(sizeof(ElemType)*SEQLIST_DEFAULT_SIZE);
assert(list->base != NULL);//在这里我们使用断言 若是断言成功,则继续执行,否则退出。
list->capacity = SEQLIST_DEFAULT_SIZE;//在这里,我们默认开辟的空间为 SEQLIST_DEFAULT_SIZE
list->len=0;
}
bool push_back(SeqList *list,ElemType x){
if(list->len >= list->capacity){
cout<<"空间已经满了"<<x<<"不能尾部插入 "<<endl;
return false;
}
list->base[list->len]=x;
list->len++;
return true;
}
bool show_list(SeqList *list){
for(int i=0;i<(list->len);i++){
cout<<list->base[i]<<" ";
}
cout<<endl;
return true;
}
bool push_front(SeqList *list,ElemType x){
if(list->len >= list->capacity){
cout<<"空间已经满了"<<x<<"不能尾部插入 "<<endl;
return false;
}
for(int i=list->len;i>0;i--){
list->base[i]=list->base[i-1];
}
list->base[0]=x;
list->len++;
return true;
}
size_t Length(SeqList *list)
{
return list->len;
}
bool insert_pos(SeqList *list,int pos,ElemType x){
if(list->len >= list->capacity){
cout<<"空间已经满了"<<x<<"不能插入 "<<endl;
return false;
}
if(pos<0 || pos>list->len){
cout<<"插入的位置非法"<<endl;
return false;
}
for(int i=list->len;i>pos;i--){
list->base[i]=list->base[i-1];
}
list->base[pos]=x;
list->len++;
return true;
}
bool pop_back(SeqList *list)
{
if(list->len==0)
{
cout<<"顺序表已空,不能删除了!"<<endl;
return false;
}
list->len--;
return true;
}
bool pop_front(SeqList *list)
{
if(list->len==0)
{
cout<<"顺序表已空,不能删除了!"<<endl;
return false;
}
for(int i=0;i<list->len-1;++i)
{
list->base[i] = list->base[i+1];
}
list->len--;
return true;
}
bool insert_val(SeqList *list,ElemType x)
{
if(list->len >= list->capacity){
cout<<"空间已经满了"<<x<<"不能插入 "<<endl;
return false;
}
for(int i=0;i<list->len;++i)
{
if(x < list->base[i])
{
for(int j=list->len;j>i;--j)
{
list->base[j]=list->base[j-1];
}
list->base[i] = x;
break;
}
}
list->len++;
return true;
}
bool delete_pos(SeqList *list,int pos)
{
if(list->len == 0)
{
cout<<"顺序表已空,不能删除"<<endl;
return false;
}
if(pos<0 || pos >= list->len)
{
cout<<"删除的位置非法,不能删除元素。"<<endl;
return false;
}
for(int i=pos;i<list->len-1;++i)
{
list->base[i] = list->base [i+1];
}
list->len--;
return true;
}
bool delete_val(SeqList *list,ElemType key)
{
if(list->len == 0)
{
cout<<"顺序表已空,不能删除"<<endl;
return false;
}
int del_pos=find_key(list,key);
if(del_pos == -1)
{
cout<<"要删除的数据"<<key<<"不存在"<<endl;
return false;
}
return delete_pos(list,del_pos);
}
int find_key(SeqList *list,ElemType key)
{
for(int i =0;i < list->len;++i)
{
if(key == list->base[i])
return i;
}
}
void reverse_list(SeqList *list)
{
if(list->len >1 )
{
int low = 0;
int high = list->len-1;
while(low < high)
{
Swap(list->base[low],list->base[high]);
low++;
high--;
}
}
}
void sort(SeqList *list)
{
if(list->len >1 )
{
for(int i=0;i < list->len-1;++i)
{
for(int j=0;j < list->len-i-1;++j)
{
if(list->base[j]>list->base[j+1])
{
Swap(list->base[j],list->base[j+1]);
}
}
}
}
}
void clear_list(SeqList *list)
{
list->len = 0;
}
void destory_list(SeqList *list)
{
free(list->base);
list->base = NULL;
list->capacity = list->len = 0;
}
#endif
主函数
SeqList.cpp
#include<iostream>
#include"SeqList.h"
using namespace std;
int main(){
SeqList mylist;
InitSeqList(&mylist);
int select = 1;
ElemType item;
int pos;
while(select){
cout<<"**************************************************************"<<endl;
cout<<"*[1]push_back [2]push_front *"<<endl;
cout<<"*[3]show_list [0]quit_system *"<<endl;
cout<<"*[4]pop_back [5]pop_front *"<<endl;
cout<<"*[6]insert_pos [7]insert_val *"<<endl;
cout<<"*[8]delete_pos [9]delete_val *"<<endl;
cout<<"*[10]find_key [11]length *"<<endl;
cout<<"*[12]reverse_list [13]sort *"<<endl;
cout<<"*[14]clear_list [15]destory_list *"<<endl;
cout<<"**************************************************************"<<endl;
cout<<"请选择:>";
cin>>select;
switch(select){
case 1:
cout<<"请输入要插入的数据(-1结束):>";
while(cin>>item,item!=-1){
push_back(&mylist,item);
}
break;
case 2:
cout<<"请输入要插入的数据(-1结束):>";
while(cin>>item,item!=-1){
push_front(&mylist,item);
}
break;
case 3:
show_list(&mylist);
break;
case 4:
pop_back(&mylist);
break;
case 5:
pop_front(&mylist);
break;
case 6:
cout<<"请输入要插入的位置:>";
cin>>pos;
cout<<"请输入要插入的值:>";
cin>>item;
insert_pos(&mylist,pos,item);
case 7:
cout<<"请输入要插入的值"<<endl;
cin>>item;
insert_val(&mylist,item);
break;
case 8:
cout<<"请输入要删除的位置:>";
cin>>pos;
delete_pos(&mylist,pos);
break;
case 9:
cout<<"请输入要删除的值:>";
cin>>item;
delete_val(&mylist,item);
break;
case 10:
cout<<"请输入要找到的值:>";
find_key(&mylist,item);
break;
case 11:
cout<<"SeqList Length = "<<Length(&mylist)<<endl;
break;
case 12:
reverse_list(&mylist);
case 13:
sort(&mylist);
break;
case 14:
clear_list(&mylist);
break;
case 15:
destory_list(&mylist);
break;
case 0:
break;
}
system("pause");
system("cls");
}
return 0;
}