数据结构之链表的使用

数据结构中的链表这一结构的基本操作

#include 
   
   
    
    
#include 
    
    
     
     

typedef struct Node{
    int data;
    struct Node *next;
}Node, *LinkedList;

LinkedList insert(LinkedList head, Node *node, int index) {
    if (head == NULL) {
        if (index != 0) {
            printf("failed\n");
            return head;
        }
        head = node;
        printf("success\n");
        return head;
    }
    if (index == 0) {
        node->next = head;
        head = node;
        printf("success\n");
        return head;
    }
    Node *current_node = head;
    int count = 0;
    while (current_node->next != NULL && count < index - 1) {
        current_node = current_node->next;
        count++;
    }
    if (count == index - 1) {
        node->next = current_node->next;
        current_node->next = node;
        printf("success\n");
        return head;
    }
    printf("failed\n");
    return head;
}

void output(LinkedList head) {
    if (head == NULL) {
        return;
    }
    Node *current_node = head;
    while (current_node != NULL) {
        printf("%d ", current_node->data);
        current_node = current_node->next;
    }
    printf("\n");
}

LinkedList delete_node(LinkedList head, int index) {
    if(head==NULL){
        printf("failed\n");
        return head;
    }
    Node* current_node=head;
    int count=0;
    if(index == 0){
        printf("success\n");
        head=head->next;
        free(current_node);
        return head;
    }
    while(current_node->next!=NULL && count < index-1 ){
        current_node=current_node->next;
        count++;
    }
    if(count==index-1 && current_node->next != NULL){
        printf("success\n");
        Node* delete_node = current_node->next;
        current_node->next = delete_node->next;
        free(delete_node);
    }
    else {
        printf("failed\n");
    }
    return head;
}

LinkedList reverse(LinkedList head) {
    if(head==NULL){
        return head;
    }
    Node *next_node,*current_node;
    current_node=head->next;
    head->next=NULL;
    while(current_node != NULL){
        next_node=current_node->next;
        current_node->next=head;
        head=current_node;
        current_node=next_node;
    }
    return head;
}

void clear(LinkedList head) {
    Node *current_node = head;
    while (current_node != NULL) {
        Node *delete_node = current_node;
        current_node = current_node->next;
        free(delete_node);
    }
}

int main() {
    LinkedList linkedlist = NULL;
    int m;
    int t[100],a[100],b[100];
    scanf("%d",&m);
    for(int i=0;i
     
     
      
      data = b[i];
            node->next = NULL;
            linkedlist = insert(linkedlist,node,a[i]);
        }
         if(t[i]==2){
            output(linkedlist);
        }
         if(t[i]==3){
            scanf("%d",&a[i]);
            linkedlist=delete_node(linkedlist,a[i]);
        }
         if(t[i]==4){
            linkedlist=reverse(linkedlist);
        }
        
    }
    return 0;
}