/*
值得学习的地方,是其中的每一个元素定义为elementType ,
以及输出格式FORMATSTR " %d "
便于移植。
*/
/*
详细请看ppt :线性表基本操作
(注:初始化len=0.添加一个元素则先填充元素到len位置,
然后len++;所以填元素的范围为0~len-1)
*/
#include <iostream>
using namespace std;
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#include<time.h>
typedef int elementType;
#define FORMARTSTR " %d "
typedef struct {
elementType* element;
int size;
int len;
}SequenceList;
// 初始化线性表。如果失败则返回0,成功返回1.
int initSequenceList(SequenceList* seList,int size){
seList->element=(elementType*)malloc(size*sizeof(elementType));
if(!(seList->element)){
return 0;
}
seList->size=size;
seList->len=0;
return 1;
}
// 判断表是否为空,空则返回1.否则返回0.
/*
int isSequenceListEmpty(SequenceList* seList){
if(seList->len)
return 1;
else return 0;
}
*/
int isSequenceListEmpty(SequenceList * seList){
if(seList->len==0)
return 1;
else return 0;
}
// 判断是否满,如果满则返回1,否则返回0.
int isSequenceListFull(SequenceList* seList){
if(seList->len==seList->size)
return 1;
else return 0;
}
// 在表后追加一个元素,追加成功则返回1.否则返回0。
int appendElement(SequenceList* seList ,elementType element){
if(isSequenceListFull(seList))
return 0;
(seList->element)[seList->len]=element;
seList->len++;
return 1;
}
// 在特定位置插入一个元素,成功则返回1.否则返回0.
int insertElement(SequenceList * seList,int i,elementType element){
if(i>seList->len|| isSequenceListFull(seList))
return 0;
int k;
for(k=seList->len-1;k>=i;k--){
(seList->element)[k+1]=(seList->element)[k];
}
(seList->element)[i]=element;
seList->len++;
return 1;
}
//删除特定位置的一个元素,成功则返回1,否则返回0;
int deleteElement(SequenceList *seList, int i){
if(i>=seList->len|| isSequenceListEmpty(seList))
return 0;
for(int k=i+1;k<seList->len;k++)
(seList->element)[k-1]=(seList->element)[k];
seList->len--;
return 1;
}
// 查找某个元素element,成功返回该元素编号,否则返回-1.
int searchElement (SequenceList * seList ,elementType element){
for(int k=0;k<seList->len;k++)
if((seList->element)[k]==element)
return k;
return -1;
}
//遍历顺序表。
int traverseSequenceList(SequenceList * seList){
for(int k=0;k<seList->len;k++)
printf(FORMARTSTR,(seList->element)[k]);
return 1;
}
// 摧毁顺序表,成功返回1.否则返回0.
int destorySequenceList(SequenceList * seList){
if(!seList->element)
return 0;
free(seList->element);
seList->element=NULL;
seList->len=0;
return 1;
}
int main()
{
int size=10;
srand(time(0));
SequenceList sequenList;
SequenceList * pSequenceList=&sequenList;
initSequenceList(pSequenceList,size);
for(int i=0;i<pSequenceList->size-3;i++)
{
appendElement(pSequenceList,rand()%20);
}
printf("\n");
traverseSequenceList(pSequenceList);
printf("\n insert an element values 100 at 4 \n");
elementType element=100;
int location=4;
insertElement(pSequenceList,location,element);
printf("\n");
traverseSequenceList(pSequenceList);
printf("\n search an element values 100 \n");
int index;
index=searchElement(pSequenceList,element);
printf("\n");
printf("the location of element valuing 100 is %d \n",index);
printf("\n delete an element values 100 \n");
deleteElement(pSequenceList,index);
printf("\n");
traverseSequenceList(pSequenceList);
cout << "\n Hello world!" << endl;
return 0;
}