链表基本知识和操作

链表基础知识：


链表基本操作：
1 初始化链接，并赋值
2 遍历
3 销毁
4 清空
5 判断是否为空
6 获取长度
7 获取索引上的元素
8 定位某一元素,判断某一元素是否在链接中
9 获取某一元素的前驱

#include <iostream>
using std::cout;
using std::endl;

#define LIST_INIT_SIZE 10
#define LIST_INCREMENT 2

typedef struct suquenceList{
  int *elem;
  int size;
  int length;
}SqList;

class SequenceList {
  public :
    int initSequenceList(SqList *L,int n);
    void traversalSequenceList(SqList *L);
    void destroySequenceList(SqList *L);
    void clearSequenceList(SqList *L);
    int isEmptySequenceList(SqList *L);
    int getSequenceListLength(SqList *L);
    int getSequenceListElem(SqList *L,int i, int *e);
    int locateSequenceListElem(SqList *L,int e);
    int priorSequenceListElem(SqList *L,int e,int *p);
};

int SequenceList::initSequenceList(SqList *L,int n){
  L->elem = (int *)malloc(n*sizeof(int*));
  if(!L->elem)
    return 1;
  L->length = 0;
  L->size = n;
  int i;
  cout << "initSequenceList: pls input the numbers to set in sequenceFile "
       << endl;
  for(i=0;i<n;i++){
    scanf("%d",L->elem+i);
    L->length++;
  }
  if(L->length==n)
    cout << "initSequenceList success";
  else
    cout << "initSequenceList failed";
  cout << endl;
  return 0;
}

void SequenceList::traversalSequenceList(SqList *L){
  int i;
  cout << "traversalSequenceList: "
       << endl;
  for(i=0;i<L->length;i++){
    cout << L->elem[i]
         << endl;
  }
}

void SequenceList::destroySequenceList(SqList *L){
  free(L->elem);
  L->elem=NULL;
  L->length=0;
  L->size=0;
  if(L->elem==NULL && L->length==0 && L->size==0){
    cout << "destroySequenceList success"
         << endl;
  }
}

void SequenceList::clearSequenceList(SqList *L){
  cout << "clearSequenceList: "
       << endl;
  L->length = 0;
}

int SequenceList::isEmptySequenceList(SqList *L){
  cout << "isEmptySequenceList: "
       << endl;
  if(L->length==0){
    cout << "SequenceList is empty"
         << endl;
    return 0;
  }else{
    cout << "SequenceList is not empty"
         << endl;
    return 1;
  }
}

int SequenceList::getSequenceListLength(SqList *L){
  cout << "getSequenceListLength : "
       << L->length
       << endl;
  return L->length;
}

int SequenceList::getSequenceListElem(SqList *L,int i,int *e){
  if( i<0 || i>L->length ){
    cout << "input index wrong"
         << endl;
    return 1;
  }
  *e=*(L->elem+i-1);
  return 0;
}

int SequenceList::locateSequenceListElem(SqList *L,int e){
  int i = -1;
  for(i=0;i<L->length;i++){
    if(L->elem[i]==e){
      break;
    }
  }
  if(i<0 || i>=L->length){
    cout << "locateSequenceListElem : index is wrong "
         << i
         << endl;
    return -1;
  }
  cout << "locateSequenceListElem : index is "
       << i
       << endl;
  return i;
}

int SequenceList::priorSequenceListElem(SqList *L,int w,int *p){

}


int main(){
  SequenceList sql;
  int n;
  cout << "pls input the sequenceFile's size; "
       << endl;
  scanf("%d",&n);
  //SqList *L;
  SqList *L=(SqList*)malloc(sizeof(SqList));
  sql.initSequenceList(L,n);
  sql.isEmptySequenceList(L);
  sql.getSequenceListLength(L);
  sql.traversalSequenceList(L);
  cout << "pls input the wanted Index : "
       << endl;
  int i;
  int *j = (int*)malloc(sizeof(int));
  scanf("%d",&i);
  sql.getSequenceListElem(L,i,j);
  cout << "L->elem[index] is "
       << *j
       << endl;
  free(j);
  cout << "pls input the wanted elem"
       << endl;
  scanf("%d",&i);
  sql.locateSequenceListElem(L,i);
  sql.clearSequenceList(L);
  sql.isEmptySequenceList(L);
  sql.getSequenceListLength(L);
  sql.traversalSequenceList(L);
  sql.destroySequenceList(L);
  free(L);
  return 0;
}