上机实验二 设计单循环链表 西安石油大学数据结构

typedef struct {
    int number;
    int cipher;
} DataType;

typedef struct SCLNode {
    DataType data;
    struct SCLNode* next;
} SCLNode;

#include <stdio.h>
#include <stdlib.h>
typedef struct Node {
    int data;
    struct Node* next;
} Node;
// 初始化链表，返回头结点
Node* initList() {
    Node* head = (Node*)malloc(sizeof(Node));
    head->next = NULL;  // 初始化时头结点指向NULL，形成空链表
    return head;
}
// 获取链表的元素个数
int listLength(Node* head) {
    int count = 0;
    Node* current = head->next;
    while (current != NULL) {
        count++;
        current = current->next;
    }
    return count;
}
// 在链表指定位置插入节点
void insertNode(Node* head, int position, int data) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->data = data;
    Node* current = head;
    int count = 0;
    while (current != NULL && count < position) {
        current = current->next;
        count++;
    }
    newNode->next = current->next;
    current->next = newNode;
}
// 删除链表指定位置的节点
void deleteNode(Node* head, int position) {
    Node* current = head;
    int count = 0;
    while (current->next != NULL && count < position) {
        current = current->next;
        count++;
    }
    if (current->next != NULL) {
        Node* temp = current->next;
        current->next = temp->next;
        free(temp);
    }
}
// 获取链表指定位置节点的值
int getNodeData(Node* head, int position) {
    Node* current = head->next;
    int count = 0;
    while (current != NULL && count < position) {
        current = current->next;
        count++;
    }
    if (current != NULL)
        return current->data;
    else
        return -1;  // 返回-1表示节点不存在
}
// 打印链表中的元素
void printList(Node* head) {
    Node* current = head->next;
    while (current != NULL) {
        printf("%d ", current->data);
        current = current->next;
    }
    printf("\n");
}
int main() {
    Node* head = initList();
    printf("初始链表为空，链表元素个数为：%d\n", listLength(head));
    insertNode(head, 0, 10);  // 在空链表中插入第一个节点
    printf("插入后的链表元素：");
    printList(head);
    insertNode(head, 0, 5);  // 在链表头部插入节点
    insertNode(head, 1, 15); // 在链表中间插入节点
    insertNode(head, 3, 20); // 在链表尾部插入节点
    printf("插入后的链表元素：");
    printList(head);
    deleteNode(head, 0); // 删除头结点
    deleteNode(head, 1); // 删除链表中的某个节点
    deleteNode(head, 2); // 删除尾节点
    printf("删除后的链表元素：");
    printList(head);
    int data1 = getNodeData(head, 0); // 取链表头结点的数据
    int data2 = getNodeData(head, 1); // 取链表中间某个节点的数据
    int data3 = getNodeData(head, 2); // 取链表尾节点的数据
    printf("取节点值的结果：\n");
    printf("Position 0: %d\n", data1);
    printf("Position 1: %d\n", data2);
    printf("Position 2: %d\n", data3);
    return 0;
}