查找
int LocateElem(SqList L, ElemType e)
{
for (int i=0; i < L.length; i++) if (L.elem[i] == e) return i + 1;
return 0;
}
插入
int ListInsert(SqList &L, int i, ElemType e)
{
if ((i < 1) || (i > L.length + 1)) return 0;
if (L.length == MAXSIZE) return 0;
for (int j = L.length - 1; j >= i-1; j--)
{
L.elem[j + 1] = L.elem[j];
}
L.elem[i - 1] = e;
L.length++;
return 1;
}
删除
int ListDelete(SqList &L, int i)
{
if ((i < 1) || (i > L.length + 1)) return 0;
for (int j = i; j < L.length; j++)
{
L.elem[j - 1] = L.elem[j];
}
L.length--;
return 1;
}
有序插入
int SqInsert(SqList &L, ElemType e)
{
int i;
if(L.length==MAXSIZE) return 0;
for ( i = L.length - 1; i >= 0; i--)
{
if (L.elem[i] > e)
{
L.elem[i + 1] = L.elem[i];
}
else break;
}
L.elem[i+1] = e;
L.length++;
return 1;
}
自己之前写的,比较繁琐。
int SqInsert(SqList &L, int e)
{
if (L.length + 1>MAXSIZE) return 0;
int i;
int j;
for (i = L.length - 1; i > -1; i--)
{
if (L.elem[i] > e) L.elem[i + 1] = L.elem[i];
else
{
j = i;
break;
}
}
if (j == 0) L.elem[j] = e;
else L.elem[j+1] = e;
L.length++;
return 1;
}
建立顺序表
SqList L;
void Create(SqList &L)
{
L.elem=new int [maxsize];
int e;
int i=0;
cin>>e;
while(e!=-1)
{
L.elem[i]=e;
i++;
cin>>e;
}
L.length=i;
}