帮我写顺序表的查找,插入,删除的C语言代码
时间: 2024-10-12 10:07:56 浏览: 6
在C语言中,我们可以使用结构体和指针来实现简单的顺序表。这里是一个基础版本的顺序表,包括查找、插入和删除操作:
```c
#include <stdio.h>
#include <stdlib.h>
// 定义顺序表节点结构体
typedef struct Node {
int data; // 数据域
struct Node* next; // 指向下一个节点的指针
} Node;
// 初始化顺序表
Node* createList() {
Node* head = NULL;
return head;
}
// 插入操作
void insert(Node** head, int value) {
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = value;
newNode->next = *head;
*head = newNode;
}
// 查找操作
int search(Node* head, int target) {
Node* current = head;
while (current != NULL) {
if (current->data == target)
return 1; // 找到目标值,返回1
current = current->next;
}
return 0; // 没找到目标值,返回0
}
// 删除操作
void delete(Node** head, int target) {
if (*head == NULL) return; // 如果列表为空,直接返回
Node* temp = *head;
if (temp->data == target) { // 首节点是目标值
*head = temp->next;
free(temp);
return;
}
while (temp->next != NULL && temp->next->data != target) {
temp = temp->next;
}
if (temp->next != NULL) {
Node* toDelete = temp->next;
temp->next = toDelete->next;
free(toDelete);
}
}
// 测试
int main() {
Node* list = createList();
insert(&list, 1);
insert(&list, 2);
insert(&list, 3);
printf("Search for 2: %d\n", search(list, 2)); // 输出1
printf("Search for 4: %d\n", search(list, 4)); // 输出0
delete(&list, 2);
printf("After deleting 2, list is: \n");
Node* current = list;
while (current != NULL) {
printf("%d -> ", current->data);
current = current->next;
}
printf("NULL\n");
return 0;
}