数据结构之顺序表

最新推荐文章于 2024-01-21 22:48:55 发布

SmartBrave

最新推荐文章于 2024-01-21 22:48:55 发布

阅读量432

点赞数

分类专栏： Exercise

本文链接：https://blog.csdn.net/SmartBrave/article/details/45606207

版权

Exercise 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

首先是头文件SeqList.h

#ifndef _SEQLIST_H
#define _SEQLIST_H

#include<iostream>
#include<assert.h>
using namespace std;

#define ElemType int
#define SEQLIST_DEFAULT_SIZE 10

typedef struct SeqList
{
	ElemType *base;
	size_t    capacity;//容量
	size_t    size;//大小
}SeqList;

int begin();
int end(SeqList *list);
void InitSeqList(SeqList *list);
bool isempty(SeqList *list);
bool isfull(SeqList *list);
bool push_back(SeqList *list,ElemType x);
bool push_front(SeqList *list,ElemType x);
bool pop_back(SeqList *list);
bool pop_front(SeqList *list);
bool insert_pos(SeqList *list, int p, ElemType x);
bool delete_val(SeqList *list, ElemType key);
void show(SeqList *list);
int find(SeqList *list,ElemType x);
bool insert_value(SeqList *list,ElemType x);
bool delete_pos(SeqList *list,int n);

ElemType getvalue(SeqList *list,int p);
bool modify(SeqList *list,ElemType val,ElemType nval);
bool clear(SeqList *list);
bool destory(SeqList *list);
bool sort(SeqList *list);
bool resver(SeqList *list);
int length(SeqList *list);
ElemType next(SeqList *list,int p);
ElemType prio(SeqList *list,int p);
#endif

函数的实现，SeqList..h：

#include"SeqList.h"

void InitSeqList(SeqList *list)
{
	list->capacity = SEQLIST_DEFAULT_SIZE;
	list->base = (ElemType*)malloc(sizeof(ElemType)*list->capacity);
	assert(list->base != NULL);
	list->size = 0;
}

int begin()
{return 0;}
int end(SeqList *list)
{return list->size;}

bool isempty(SeqList *list)
{return list->size == 0;}
bool isfull(SeqList *list)
{return list->size >= list->capacity;}

bool push_back(SeqList *list,ElemType x)
{
	return insert_pos(list,end(list),x);
}
bool push_front(SeqList *list,ElemType x)
{
	return insert_pos(list,begin(),x);
}
/*
bool push_back(SeqList *list,ElemType x)
{
	if(isfull(list))
		return false;
	list->base[list->size++] = x;
	return true;
}

bool push_front(SeqList *list,ElemType x)
{
	if(isfull(list))
		return false;
	
	for(int i=list->size; i>0; --i)
	{
		list->base[i] = list->base[i-1];
	}
	list->base[0] = x;

	list->size++;
	return true;
}
*/
bool pop_back(SeqList *list)
{
	if(isempty(list))
		return false;
	list->size--;
	return true;
}
int find(SeqList *list,ElemType x)
{
	if(isempty(list))
		return false;
	for (int i=0;i<list->size;i++)
	{
		if (list->base[i]==x)
		{
			return i;
		}
	}
	return -1;
}
bool delete_pos(SeqList *list,int p)
{
	if(isempty(list))
		return false;
	if(p<0 || p>list->size)
		return false;
	for (int i=p;i<list->size;i++)
	{
		list->base[i]=list->base[i+1];
	}
	list->size--;
	return true;
}


bool insert_value(SeqList *list,ElemType x)
{
	if(isfull(list))
		return false;
	for (int i=list->size;i>0;i--)
	{
		if (list->base[i]>x&&list->base[i-1]<x)
		{
			break;
		}
		list->base[i]=list->base[i-1];
	}
	list->base[i]=x;
	list->size++;
	return true;
}


bool pop_front(SeqList *list)
{
	if(isempty(list))
		return false;
	for(int i=0; i<list->size-1; ++i)
	{
		list->base[i] = list->base[i+1];
	}
	list->size--;
	return true;
}

bool insert_pos(SeqList *list, int p, ElemType x)
{
	if(isfull(list))
		return false;
	if(p<0 || p>list->size)
		return false;

	for(int i=list->size; i>p; --i)
	{
		list->base[i] = list->base[i-1];
	}
	list->base[p] = x;
	list->size++;
	return true;
}

bool delete_val(SeqList *list, ElemType key)
{
	int pos= find(list,key);
	if(pos == -1)
		return false;
	delete_pos(list,pos);
	return true;
}

/*
bool delete_val(SeqList *list, ElemType key)
{
	for(int i=0; i<list->size; ++i)
	{
		if(list->base[i] == key)
			break;
	}
	if(i >= list->size)
		return false;
	for(int k=i; k<list->size-1; ++k)
	{
		list->base[k] = list->base[k+1];
	}
	list->size--;
	return true;
}
*/
void show(SeqList *list)
{
	for(int i=0; i<list->size; ++i)
	{
		cout<<list->base[i]<<" ";
	}
	cout<<endl;
}

ElemType getvalue(SeqList *list,int p)
{
	if(isempty(list))
		return false;
	if(p<0 || p>list->size)
		return false;
	return list->base[p];
}
bool modify(SeqList *list,ElemType val,ElemType nval)
{
	if(isempty(list))
		return false;
	for (int i=0;i<list->size;i++)
	{
		if (list->base[i]==val)
		{
			list->base[i]=nval;
		}
	}
	return true;
}
bool clear(SeqList *list)
{
	if(isempty(list))
		return false;
	list->size=0;
}
bool destory(SeqList *list)
{
	if(isempty(list))
		return false;
	free(list);
	return true;
}
bool sort(SeqList *list)
{
	if(isempty(list))
		return false;
	for (int i=0;i<list->size;i++)
	{
		for (int j=i;j<list->size;j++)
		{
			if (list->base[i]>list->base[j])
			{
				ElemType tmp=list->base[i];
				list->base[i]=list->base[j];
				list->base[j]=tmp;
			}
		}
	}
	return true;
}
bool resver(SeqList *list)
{
	if(isempty(list))
		return false;
	for (int i=0;i<list->size/2;i++)
	{
		ElemType tmp=list->base[i];
		list->base[i]=list->base[list->size-i-1];
		list->base[list->size-i-1]=tmp;
	}
	return true;
}
int length(SeqList *list)
{
	return list->size;
}
ElemType next(SeqList *list,int p)
{
	if(isempty(list))
		return false;
	if(p<0 || p>list->size-1)
		return false;
	return list->base[p+1];
}
ElemType prio(SeqList *list,int p)
{
	if(isempty(list))
		return false;
	if(p<1 || p>list->size)
		return false;
	return list->base[p-1];
}

主函数main.cpp:

#include<iostream>
#include"SeqList.h"
using namespace std;

void main()
{
	SeqList mylist;
	InitSeqList(&mylist);
	
	int select = 1;
	ElemType item,nitem;
	int pos;
	while(select)
	{
		cout<<"**********************************"<<endl;
		cout<<"* [1] push_back   [2] push_front *"<<endl;//尾插法	头插法
		cout<<"* [3] show_seqlist[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       [11]getvalue   *"<<endl;//查找		输入下标得到值
		cout<<"* [12] modify     [13]clear      *"<<endl;//修改		清除
		cout<<"* [14] destroy    [15]sort       *"<<endl;//销毁		排序
		cout<<"* [16] resver     [17]length     *"<<endl;//翻转		求长度
		cout<<"* [18] next       [19]prio       *"<<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(&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);
			break;
		case 7:
			cout<<"请输入要插入的值:>";
			cin>>item;
			insert_value(&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<<"请输入要查找的值:>";
			cin>>item;
			cout<<"该值得下标是:"<<find(&mylist,item)<<endl;
			break;
		case 11:
			cout<<"请输入要查找的值的下标:>";
			cin>>pos;
			cout<<"该下标对应的值是:"<<getvalue(&mylist,pos)<<endl;
			break;
		case 12:
			cout<<"请输入要修改的值:>";
			cin>>item;
			cout<<"请输入新值:>";
			cin>>nitem;
			modify(&mylist,item,nitem);
			break;
		case 13:
			clear(&mylist);
			break;
		case 14:
			destory(&mylist);
			break;
		case 15:
			sort(&mylist);
			break;
		case 16:
			resver(&mylist);
			break;
		case 17:
			cout<<"长度为:"<<length(&mylist)<<endl;
			break;
		case 18:
			cout<<"请输入下标:>";
			cin>>pos;
			cout<<"下一个值是:"<<next(&mylist,pos)<<endl;
			break;
		case 19:
			cout<<"请输入下标:>";
			cin>>pos;
			cout<<"前一个值是:"<<prio(&mylist,pos)<<endl;
			break;
		default:
			break;
		}
	}
}