将做工程过程比较常用的代码片段珍藏起来,如下资料是关于C++顺序表操作演示的代码,希望对大伙也有用处。
#include
#include “malloc.h”
#include <stdio.h>
using namespace std;
struct SqList{
int length;
int listsize;
}L={NULL,0,0};
enum Status
{
};
Status InitList_Sq(SqList &L,int n=LIST_INT_SIZE)
{
if(0n)return FAILED;
if(!L.elem) exit(OVERFLOW1);
L.length=0;
L.listsize=n;
return OK;
}
Status ListInsert_Sq(SqList &L,int i,ElemType e)
if(L.length>=L.listsize)
{
L.elem=newbase;
L.listsize++;
}
for(;p>q;p–)
L.length++;
return OK;
}
{
if(L.length<0||i>L.length||i<=0) return FAILED;
if(0L.length) return EMPTY;
if(e)
for(;p<=L.elem+L.length;p++)
{
}