bool Del_min(sqList &L,ElemType &value)
{
if(L.length == 0)
{
return flase;
}
value = L.data[0];
int pos = 0;
for(int i = 1; i < L.length; i++)
{
if(L.dada[i] < value)
{
value = L.data[i];
pos = i;
}
}
L.data[pos] = L.data[L.length-1];
L.length--;
return true;
}
void Reverse(Sqlist &L)
{
ElemType temp;
for(i = 0; i < L.length/2; i++)
{
temp = L.data[i];
L.data[i] = L.data[L.length-i-1];
L.data[L.length-i-1] = temp;
}
}
void del_x_1(Sqlist &L, Elemtype x)
{
int k = 0;
for(int i = 0; i < L.length; i++)
{
if(data[i] != x)
{
L.data[k] = L.data[i];
k++;
}
}
L.length = k;
}
void del_x_2(Sqlist &L, Elemtype x)
{
int k = 0; i = 0;
while(i < L.length)
{
if(L.data[i] == x)
{
k++;
}else{
L.data[i-k] = L.data[i];
}
i++;
}
L.length = L.length - k;
}
bool Del_s_t2(Sqlist &L, Elemtype s, Elemtype t)
{
int i, j;
if(s >= t || L.length == 0)
{
return false;
}
for( i = 0; i < L.length && L.data[i] < s; i++);
if(i >= L.length)
{
return false;
}
for(j = i; j < L.length && L.data[j] <= t; j++);
for(; j < L.length; i++, j++)
{
L.data[i] = L.data[j];
}
L.length = i+1;
return true;
}
bool Del_s_t(Sqlist &L, Elemtype s, Elemtype t)
{
int i, k;
if(L.length == 0 || s > t)
{
return flase;
}
for(i = 0; i < length; i++)
{
if(L.data[i] >= s && L.data[i] <= t)
{
K++;
}else{
L.data[i-k] = L.data[i];
}
}
L.length = Length - k;
return true;
}
bool Delete_Same(Sqlist &L)
{
if(L.length == 0)
{
return false;
}
int i, j;
for(i = 0, j = 1; j < L.length; j++)
{
if(L.data[i] != L.data[j])
{
L.data[++i] = L.data[j];
}
}
L.length = i+1;
return true;
}
王道数据结构
猜你喜欢
转载自blog.csdn.net/LiuJiuXiaoShiTou/article/details/81412249
今日推荐
周排行