实现顺序线性表的创建,打印,插入和删除数据c语言实现
时间: 2024-09-17 16:05:44 浏览: 12
在 C 语言中,我们可以使用数组或链表来实现顺序线性表的创建、打印、插入和删除操作。这里我们以单链表为例,因为链表提供更好的动态存储空间效率。
**1. 创建(初始化)顺序线性表(链表):**
```c
typedef struct Node {
int data;
struct Node* next;
} Node;
Node* createList(int n) {
if (n <= 0) return NULL;
Node* head = (Node*)malloc(sizeof(Node));
head->data = 0; // 初始化第一个元素
head->next = NULL;
for (int i = 1; i < n; ++i) {
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = i;
newNode->next = head->next;
head->next = newNode;
}
return head;
}
```
**2. 打印顺序线性表:**
```c
void printList(Node* head) {
Node* temp = head;
while (temp != NULL) {
printf("%d ", temp->data);
temp = temp->next;
}
printf("\n");
}
```
**3. 插入数据:**
```c
void insertNode(Node** head, int position, int value) {
if (position < 1 || position > length(head)) {
printf("Invalid position.\n");
return;
}
Node* newNode = (Node*)malloc(sizeof(Node));
newNode->data = value;
newNode->next = NULL;
if (position == 1) { // 插入到头部
newNode->next = *head;
*head = newNode;
} else {
Node* current = *head;
int index = 1;
while (index < position - 1 && current->next != NULL) {
current = current->next;
index++;
}
newNode->next = current->next;
current->next = newNode;
}
}
```
**4. 删除数据:**
```c
void deleteNode(Node** head, int position) {
if (position < 1 || position > length(head)) {
printf("Invalid position.\n");
return;
}
if (position == 1) { // 删除头节点
Node* temp = *head;
*head = (*head)->next;
free(temp);
} else {
Node* current = *head;
int index = 1;
while (current->next != NULL && index < position - 1) {
current = current->next;
index++;
}
if (current->next != NULL) {
Node* toDelete = current->next;
current->next = current->next->next;
free(toDelete);
}
}
}
// 假设length()函数用于计算链表长度
size_t length(Node* head) {
size_t count = 0;
Node* temp = head;
while (temp != NULL) {
count++;
temp = temp->next;
}
return count;
}
```