下面是顺序表(Sequential List)的各个基本操作的代码实现:
```c
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 100
typedef struct {
int data[MAX_SIZE];
int length;
} SequentialList;
// 初始化顺序表
void initList(SequentialList *list) {
list->length = 0;
}
// 判断顺序表是否为空
int isEmpty(SequentialList *list) {
return list->length == 0;
}
// 获取顺序表长度
int getLength(SequentialList *list) {
return list->length;
}
// 在指定位置插入元素
int insert(SequentialList *list, int position, int element) {
if (position < 1 || position > list->length + 1) {
printf("Error: Invalid position\n");
return 0;
}
if (list->length >= MAX_SIZE) {
printf("Error: Sequential list is full\n");
return 0;
}
for (int i = list->length - 1; i >= position - 1; i--) {
list->data[i + 1] = list->data[i];
}
list->data[position - 1] = element;
list->length++;
return 1;
}
// 删除指定位置的元素
int delete(SequentialList *list, int position) {
if (position < 1 || position > list->length) {
printf("Error: Invalid position\n");
return 0;
}
for (int i = position; i < list->length; i++) {
list->data[i - 1] = list->data[i];
}
list->length--;
return 1;
}
// 获取指定位置的元素
int getElement(SequentialList *list, int position) {
if (position < 1 || position > list->length) {
printf("Error: Invalid position\n");
return -1;
}
return list->data[position - 1];
}
// 修改指定位置的元素
int modify(SequentialList *list, int position, int element) {
if (position < 1 || position > list->length) {
printf("Error: Invalid position\n");
return 0;
}
list->data[position - 1] = element;
return 1;
}
// 打印顺序表中的元素
void printList(SequentialList *list) {
printf("Sequential List: ");
for (int i = 0; i < list->length; i++) {
printf("%d ", list->data[i]);
}
printf("\n");
}
int main() {
SequentialList list;
initList(&list);
insert(&list, 1, 10);
insert(&list, 2, 20);
insert(&list, 3, 30);
insert(&list, 4, 40);
printList(&list);
delete(&list, 2);
printList(&list);
int element = getElement(&list, 3);
printf("Element at position 3: %d\n", element);
modify(&list, 1, 50);
printList(&list);
return 0;
}
```
这段代码实现了顺序表的基本操作,包括初始化顺序表 `initList`,判断顺序表是否为空 `isEmpty`,获取顺序表长度 `getLength`,在指定位置插入元素 `insert`,删除指定位置的元素 `delete`,获取指定位置的元素 `getElement`,修改指定位置的元素 `modify`,以及打印顺序表中的元素 `printList`。
在 `main` 函数中,我们演示了如何使用这些基本操作来创建顺序表、插入元素、删除元素、获取元素、修改元素,并打印顺序表的内容。
需要注意的是,这里使用了 `MAX_SIZE` 宏定义来限制顺序表的最大长度,你可以根据实际需求进行调整。此外,这只是一个简单的示例,实际应用中可能需要根据具体需求进行修改和扩展。
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 100
typedef struct {
int data[MAX_SIZE];
int length;
} SequentialList;
// 初始化顺序表
void initList(SequentialList *list) {
list->length = 0;
}
// 判断顺序表是否为空
int isEmpty(SequentialList *list) {
return list->length == 0;
}
// 获取顺序表长度
int getLength(SequentialList *list) {
return list->length;
}
// 在指定位置插入元素
int insert(SequentialList *list, int position, int element) {
if (position < 1 || position > list->length + 1) {
printf("Error: Invalid position\n");
return 0;
}
if (list->length >= MAX_SIZE) {
printf("Error: Sequential list is full\n");
return 0;
}
for (int i = list->length - 1; i >= position - 1; i--) {
list->data[i + 1] = list->data[i];
}
list->data[position - 1] = element;
list->length++;
return 1;
}
// 删除指定位置的元素
int delete(SequentialList *list, int position) {
if (position < 1 || position > list->length) {
printf("Error: Invalid position\n");
return 0;
}
for (int i = position; i < list->length; i++) {
list->data[i - 1] = list->data[i];
}
list->length--;
return 1;
}
// 获取指定位置的元素
int getElement(SequentialList *list, int position) {
if (position < 1 || position > list->length) {
printf("Error: Invalid position\n");
return -1;
}
return list->data[position - 1];
}
// 修改指定位置的元素
int modify(SequentialList *list, int position, int element) {
if (position < 1 || position > list->length) {
printf("Error: Invalid position\n");
return 0;
}
list->data[position - 1] = element;
return 1;
}
// 打印顺序表中的元素
void printList(SequentialList *list) {
printf("Sequential List: ");
for (int i = 0; i < list->length; i++) {
printf("%d ", list->data[i]);
}
printf("\n");
}
int main() {
SequentialList list;
initList(&list);
insert(&list, 1, 10);
insert(&list, 2, 20);
insert(&list, 3, 30);
insert(&list, 4, 40);
printList(&list);
delete(&list, 2);
printList(&list);
int element = getElement(&list, 3);
printf("Element at position 3: %d\n", element);
modify(&list, 1, 50);
printList(&list);
return 0;
}