头文件:
SeqLish.h
#ifndef __SEQLIST_H__
#define __SEQLIST_H__
#include<stdio.h>
#include<malloc.h>
#include<assert.h>
#define SEQLIST_INIT_SIZE 8
#define INC_SIZE 3
typedef int ElemType;
typedef struct SeqList
{
ElemType *base;
int capacity;
int size;
}SeqList;
bool Inc(SeqList *list);
void InitSeqList(SeqList *list);
void push_back(SeqList *list, ElemType x);
void push_front(SeqList *list, ElemType x);
void show_list(SeqList *list);
void pop_back(SeqList *list);
void pop_front(SeqList *list);
void insert_pos(SeqList *list, int pos, ElemType x);
int find(SeqList *list, ElemType key);
int length(SeqList *list);
void delete_pos(SeqList *list, int pos);
void delete_val(SeqList *list, ElemType key);
void sort(SeqList *list);
void resver(SeqList *list);
void clear(SeqList *list);
void destroy(SeqList *list);
void merge(SeqList *lt, SeqList *la, SeqList *lb);
#endif //__SEQLIST_H__
Main.cpp
#include"SeqList.h"
void main()
{
SeqList mylist,youlist,list;
InitSeqList(&mylist);
InitSeqList(&youlist);
push_back(&mylist,1);
push_back(&mylist,3);
push_back(&mylist,5);
push_back(&mylist,7);
push_back(&mylist,9);
push_back(&youlist,2);
push_back(&youlist,4);
//push_back(&youlist,6);
push_back(&youlist,8);
//push_back(&youlist,10);
merge(&list,&mylist,&youlist);
show_list(&list);
}
/*
void main()
{
SeqList mylist;
InitSeqList(&mylist);
ElemType Item;
int pos;
int select = 1;
while(select)
{
printf("**************************************\n");
printf("* [1] push_back [2] push_fornt *\n");
printf("* [3] show_list [4] pop_back *\n");
printf("* [5] pop_front [6] insert_pos *\n");
printf("* [7] find [8] lenght *\n");
printf("* [9] delete_pos [10] delete_val *\n");
printf("* [11] sort [12] resver *\n");
printf("* [13] clear [14*] destroy *\n");
printf("* [0] quit_system *\n");
printf("**************************************\n");
printf("请选择:>");
scanf("%d",&select);
if(select == 0)
break;
switch(select)
{
case 1:
printf("请输入要插入的数据(-1结束):>");
while(scanf("%d",&Item),Item!=-1)
{
push_back(&mylist,Item);
}
break;
case 2:
printf("请输入要插入的数据(-1结束):>");
while(scanf("%d",&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:
printf("请输入要插入数据:>");
scanf("%d",&Item);
printf("请输入要插入的位置:>");
scanf("%d",&pos);
insert_pos(&mylist,pos,Item);
break;
case 7:
printf("请输入要查找的数据:>");
scanf("%d",&Item);
pos = find(&mylist,Item);
if(pos == -1)
printf("查找的数据%d在顺序表中不存在.\n",Item);
else
printf("查找的数据%d在顺序表中的%d下标位置.\n",Item,pos);
break;
case 8:
printf("顺序表的长度为:> %d\n",length(&mylist));
break;
case 9:
printf("请输入要删除数据的位置:>");
scanf("%d",&pos);
delete_pos(&mylist,pos);
break;
case 10:
printf("请输入要删除的数据:>");
scanf("%d",&Item);
delete_val(&mylist,Item);
break;
case 11:
sort(&mylist);
break;
case 12:
resver(&mylist);
break;
case 13:
clear(&mylist);
break;
//case 14:
//destroy(&mylist);
// break;
default:
printf("输入的选择错误,请重新输入.\n");
break;
}
}
destroy(&mylist);
}
*/
SeqList.cpp
#include"SeqList.h"
bool Inc(SeqList *list)
{
ElemType *newbase = (ElemType*)realloc(list->base,sizeof(ElemType)*(list->capacity+INC_SIZE));
if(newbase == NULL)
{
printf("增配空间失败,内存不足.\n");
return false;
}
list->base = newbase;
list->capacity += INC_SIZE;
return true;
}
void InitSeqList(SeqList *list)
{
list->base = (ElemType *)malloc(sizeof(ElemType) * SEQLIST_INIT_SIZE);
assert(list->base != NULL);
list->capacity = SEQLIST_INIT_SIZE;
list->size = 0;
}
void push_back(SeqList *list, ElemType x)
{
if(list->size >= list->capacity && !Inc(list))
{
printf("顺序表空间已满,%d不能尾部插入数据.\n",x);
return;
}
list->base[list->size] = x;
list->size++;
}
void push_front(SeqList *list, ElemType x)
{
if(list->size >= list->capacity && !Inc(list))
{
printf("顺序表空间已满,%d不能头部插入数据.\n",x);
return;
}
for(int i=list->size; i>0; --i)
{
list->base[i] = list->base[i-1];
}
list->base[0] = x;
list->size++;
}
void show_list(SeqList *list)
{
for(int i=0; i<list->size; ++i)
{
printf("%d ",list->base[i]);
}
printf("\n");
}
void pop_back(SeqList *list)
{
if(list->size == 0)
{
printf("顺序表已空,不能尾部删除数据.\n");
return;
}
list->size--;
}
void pop_front(SeqList *list)
{
if(list->size == 0)
{
printf("顺序表已空,不能尾部删除数据.\n");
return;
}
for(int i=0; i<list->size-1; ++i)
{
list->base[i] = list->base[i+1];
}
list->size--;
}
void insert_pos(SeqList *list, int pos, ElemType x)
{
if(pos<0 || pos>list->size)
{
printf("插入数据的位置非法,不能插入数据.\n");
return;
}
if(list->size >= list->capacity && !Inc(list))
{
printf("顺序表空间已满,%d不能按位置插入数据.\n",x);
return;
}
for(int i=list->size; i>pos; --i)
{
list->base[i] = list->base[i-1];
}
list->base[pos] = x;
list->size++;
}
int find(SeqList *list, ElemType key)
{
for(int i=0; i<list->size; ++i)
{
if(list->base[i] == key)
return i;
}
return -1;
}
int length(SeqList *list)
{
return list->size;
}
void delete_pos(SeqList *list, int pos)
{
if(pos<0 || pos>=list->size)
{
printf("删除数据的位置非法,不能删除数据.\n");
return;
}
for(int i=pos; i<list->size-1; ++i)
{
list->base[i] = list->base[i+1];
}
list->size--;
}
void delete_val(SeqList *list, ElemType key)
{
int pos = find(list,key);
if(pos == -1)
{
printf("要删除的数据不存在.\n");
return;
}
delete_pos(list,pos);
}
void sort(SeqList *list)
{
for(int i=0; i<list->size-1; ++i)
{
for(int j=0; j<list->size-i-1; ++j)
{
if(list->base[j] > list->base[j+1])
{
ElemType tmp = list->base[j];
list->base[j] = list->base[j+1];
list->base[j+1] = tmp;
}
}
}
}
void resver(SeqList *list)
{
if(list->size==0 || list->size==1)
return;
int low = 0;
int high = list->size-1;
ElemType tmp;
while(low < high)
{
tmp = list->base[low];
list->base[low] = list->base[high];
list->base[high] = tmp;
low++;
high--;
}
}
void clear(SeqList *list)
{
list->size = 0;
}
void destroy(SeqList *list)
{
free(list->base);
list->base = NULL;
list->capacity = 0;
list->size = 0;
}
void merge(SeqList *lt, SeqList *la, SeqList *lb)
{
lt->capacity = la->size + lb->size;
lt->base = (ElemType*)malloc(sizeof(ElemType)*lt->capacity);
assert(lt->base != NULL);
int ia = 0;
int ib = 0;
int ic = 0;
while(ia<la->size && ib<lb->size)
{
if(la->base[ia] < lb->base[ib])
lt->base[ic++] = la->base[ia++];
else
lt->base[ic++] = lb->base[ib++];
}
while(ia < la->size)
{
lt->base[ic++] = la->base[ia++];
}
while(ib < lb->size)
{
lt->base[ic++] = lb->base[ib++];
}
lt->size = la->size + lb->size;
}
/*
void insert_pos(SeqList *list, int pos, ElemType x)
{
if(pos<0 || pos>list->size)
{
printf("插入数据的位置非法,不能插入数据.\n");
return;
}
if(pos == 0)
push_front(list,x);
else if(pos == list->size)
push_back(list,x);
else
{
for(int i=list->size; i>pos; --i)
{
list->base[i] = list->base[i-1];
}
list->base[pos] = x;
list->size++;
}
}
*/