第二章：顺序表的实现

一、初始化顺序表

void Slinit(SL* ps)
{
	ps->a = NULL;
	ps->capicity = ps->size = 0;
}

二、打印顺序表

void print_sl(SL* ps)
{
	int i = 0;
	for (i = 0; i < ps->size; i++)
	{
		printf("%d ", ps->a[i]);
	}
	printf("\n");
}

三、判断容量

void SLcheck(SL* ps)
{
	if (ps->capicity == ps->size)//如果容量不够进入
	{
		SLtyped newcapicity = ps->capicity == 0 ? 4 : ps->capicity*2;//如果容量为0，则将容量变为4，否则容量翻倍。
		SLtyped* tmp = (SLtyped*)realloc(ps->a, newcapicity * sizeof(SLtyped));//为顺序表重新开辟空间。
		if (tmp == NULL)
		{
			printf("realloc fail\n");
			exit(-1);
		}
		ps->a = tmp;
		ps->capicity = newcapicity;
	}
}

四、尾插

void SLPushBack(SL* ps, SLtyped x)
{
	SLcheck(&sl);
	ps->a[ps->size] = x;
	ps->size++;
}

五、头插

void SLpushfront(SL* ps, sltype x)
{
	SLjudge(&sl);
	int end = ps->size - 1;
	while (end >= 0)
	{
		ps->a[end + 1] = ps->a[end];
		end--;
	}
	ps->a[0] = x;
	ps->size++;
}

六、尾删

void SLpopback(SL* ps)
{
	ps->size--;
}

七、头删

void SLpushfront(SL* ps)
{
	int end = 0;
	while (end < ps->size - 1)
	{
		ps->a[end] = ps->a[end + 1];
		end++;
	}
	ps->size--;
}

八、插入

void SLinsert(SL* ps,int pos,sltype x)
{
    assert(pos >= 0 && pos <= ps->size);
    
	SLjudge(&sl);
	int end = ps->size;
	while (end > pos - 1)
	{
		ps->a[end] = ps->a[end - 1];
		end--;
	}
	ps->a[pos - 1] = x;
	ps->size++;
}

九、删除

void SLerase(SL* ps, int pos)
{
    assert(pos >= 0 && pos <= ps->size);
    
	while (pos < ps->size)
	{
		ps->a[pos - 1] = ps->a[pos];
		pos++;
	}
	ps->size--;
}

十、查找

int SLfind(SL* ps, sltype x)
{
    assert(pos >= 0 && pos <= ps->size);
    
	for (int i = 0; i < ps->size; i++)
	{
		if (ps->a[i] == x)
		{
			return i;
		}
	}
	return -1;
}

十一、替换

 void SLal(SL* ps, int y, sltype x)
{
    assert(pos >= 0 && pos <= ps->size);
    
	ps->a[y] = x;
}

总结

看到这里不要以为就结束了，赶快点击到下一章的习题练习检验自己会不会吧！！

如果觉得浩克写的还不错的话，记得关注浩克奥，我们一起努力！