C语言顺序表（动态分配）查找

顺序表的按位查找与按值查找

关键代码：

//按位查找
int GetElem(SeqList L, int i) {
	if (i<1 || i>L.length)
		return 0;
	return L.data[i - 1];
}
//按值查找
int LocateElem(SeqList L, int e)
{
	for (int i = 0; i < L.length; i++) {
		if (L.data[i] == e)
		{
			return i + 1;
		}
	}
	return 0;
}

完整程序代码：

#include<stdio.h>
#include<stdlib.h>
#define InitSize 10
typedef struct {
	int *data;
	int MaxSize;
	int length;
}SeqList;
//初始化顺序表
void InitList(SeqList &L) {
	L.data = (int *)malloc(sizeof(int)*InitSize);
	L.length = 0;//初始化长度（空表）
	L.MaxSize = InitSize;
	
}
//动态增加顺序表长度
void IncreaseSize(SeqList &L, int len) {
	int *p = L.data;
	L.data = (int *)malloc(sizeof(int)*(L.MaxSize + len));
	for (int i = 0; i < L.length; i++) {
		L.data[i] = p[i];//将数据复制到新区域
	}
	L.MaxSize = L.MaxSize + len;
	free(p);

}
//插入
bool ListInsert(SeqList&L, int i, int &e) {
	if (i<1 || i>L.length + 1 || L.length >=L.MaxSize)
	{
		printf("不能插入\n");
		
		return false;
	}
	for (int j = L.length; j >= i; j--) {
		L.data[j] = L.data[j - 1];
	}
	L.data[i - 1] = e;
	L.length++;
	return true;
}
//删除
bool ListDelete(SeqList &L, int i, int &e) {
	if (i<1 || i>L.length) {
		return false;
	}
	e = L.data[i - 1];//被删除的元素赋值给e
	for (int j = i; j < L.length; j++) {
		L.data[j - 1] = L.data[j];
	}
	L.length--;
	return true;
}
//按位查找
int GetElem(SeqList L, int i) {
	if (i<1 || i>L.length)
		return 0;
	return L.data[i - 1];
}
//按值查找
int LocateElem(SeqList L, int e)
{
	for (int i = 0; i < L.length; i++) {
		if (L.data[i] == e)
		{
			return i + 1;
		}
	}
	return 0;
	
}
int main() {
	SeqList L;
	InitList(L);
	L.length = 5;
	for (int i = 0; i < L.length; i++)
	{
		L.data[i] = i;
	}
	int n = -1;
	if (ListInsert(L, 2, n))
	{
		for (int i = 0; i < L.length; i++)
		{
			printf("data[%d]=%d\n", i, L.data[i]);
		}
		printf("插入第2个元素，插入的元素值为：%d\n\n", n);
	}
	else {
		printf("error\n");
	}
     int e = -1;
	if (ListDelete(L, 2, e))
	{
		for (int i = 0; i < L.length; i++)
		{
			printf("data[%d]=%d\n", i, L.data[i]);

		}
		printf("删除第2个元素，删除的元素值为：%d\n\n", e);
	}
	else{
		printf("error\n");
	}
	
		printf("按位查找第2个元素，查到的元素值为：%d\n\n", GetElem(L, 2));

		int m = 3;
		printf("按值查找值为3的元素，查到的元素所在位序为：%d\n\n", LocateElem(L, m));

		system("pause");
	return 0;
}

运行结果截图如下 ：

 

 

总结思维导图：