C语言实现顺序表的基本操作

C语言实现顺序表的基本操作

#include <stdio.h>
#include <stdlib.h>

#define MAX_SIZE 100

typedef struct {
    int data[MAX_SIZE];
    int length;
} SeqList;

void initList(SeqList* list) {
    list->length = 0;
}

void insert(SeqList* list, int position, int item) {
    int i; // 将变量的声明移至此处

    if (position < 0 || position > list->length || list->length == MAX_SIZE) {
        printf("Invalid position or list is full\n");
        return;
    }

    for (i = list->length - 1; i >= position; i--) {
        list->data[i + 1] = list->data[i];
    }

    list->data[position] = item;
    list->length++;
}

void delete(SeqList* list, int position) {
    int i; // 将变量的声明移至此处

    if (position < 0 || position >= list->length) {
        printf("Invalid position\n");
        return;
    }

    for (i = position; i < list->length - 1; i++) {
        list->data[i] = list->data[i + 1];
    }

    list->length--;
}

int search(SeqList* list, int key) {
    int i; // 将变量的声明移至此处

    for (i = 0; i < list->length; i++) {
        if (list->data[i] == key) {
            return i;
        }
    }

    return -1;
}

void display(SeqList* list) {
    int i; // 将变量的声明移至此处

    printf("List elements: ");
    for (i = 0; i < list->length; i++) {
        printf("%d ", list->data[i]);
    }
    printf("\n");
}

int main() {
    SeqList list;
    int choice, item, position, key, index;

    initList(&list);

    while (1) {
        printf("1. Insert\n");
        printf("2. Delete\n");
        printf("3. Search\n");
        printf("4. Display\n");
        printf("5. Exit\n");

        printf("Enter your choice: ");
        scanf("%d", &choice);

        switch (choice) {
            case 1:
                printf("Enter the element to be inserted: ");
                scanf("%d", &item);
                printf("Enter the position: ");
                scanf("%d", &position);
                insert(&list, position, item);
                break;
            case 2:
                printf("Enter the position: ");
                scanf("%d", &position);
                delete(&list, position);
                break;
            case 3:
                printf("Enter the key to search: ");
                scanf("%d", &key);
                index = search(&list, key);
                if (index != -1) {
                    printf("Element found at position: %d\n", index);
                } else {
                    printf("Element not found\n");
                }
                break;
            case 4:
                display(&list);
                break;
            case 5:
                exit(0);
            default:
                printf("Invalid choice\n");
                break;
        }
    }

    return 0;
}