C language makes it easy to add, delete, modify and check the linked list "suggested collection"

Hello everyone , I meet you again , I'm your friend, Quan Jun .

notes ： Simple pursuit of code simplicity , So the writing may not be standard .

// Take it for the first time c Start writing data structures , Because of what I wrote , Pursue less code , And College ppt Not quite the same. . Please point out the mistakes 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef struct node// Define the node 
{
    int data;
    struct node * next;
}Node;

Copy

// Function introduction 
void printlist(Node * head)// Print linked list 
int lenlist(Node * head)// Return the length of the list 
void insertlist(Node ** list,int data,int index)// Insert elements 
void pushback(Node ** head,int data)// Tail insertion 
void freelist(Node ** head)// Empty the list 
void deletelist(Node ** list,int data)// Remove elements 
Node * findnode(Node ** list,int data)// lookup 
void change(Node ** list,int data,int temp)// Change the value 

Copy

Print

void printlist(Node * head)// Print linked list 
{
    for(;head!=NULL;head=head->next) printf("%d ",head->data);
    printf("\n");// Print for other functions , Last line break 
}

Copy

Chain length

int lenlist(Node * head)// Return the length of the list 
{
    int len;
    Node * temp = head;
    for(len=0; temp!=NULL; len++) temp=temp->next;
    return len;
}

Copy

Insert elements

void insertlist(Node ** list,int data,int index)// Insert elements , use *list take head Pointers and next Unified expression 
{
    if(index<0 || index>lenlist(*list))return;// Judge illegal input 
    Node * newnode=(Node *)malloc(sizeof(Node));// establish 
    newnode->data=data;
    newnode->next=NULL;
    while(index--)list=&((*list)->next);// Insert 
    newnode->next=*list;
    *list=newnode;
}

Copy

Add element to tail

void pushback(Node ** head,int data)// Tail insertion , ditto 
{
    Node * newnode=(Node *)malloc(sizeof(Node));// establish 
    newnode->data=data;
    newnode->next=NULL;
    while(*head!=NULL)head=&((*head)->next);// Insert 
    *head=newnode;
}

Copy

Empty the list

void freelist(Node ** head)// Empty the list 
{
    Node * temp=*head;
    Node * ttemp;
    *head=NULL;// The pointer is set to null 
    while(temp!=NULL)// Release 
    {
        ttemp=temp;
        temp=temp->next;
        free(ttemp);
    }
}

Copy

Delete

void deletelist(Node ** list,int data)// Delete the linked list node 
{
    Node * temp;// It's just convenient free
    while((*list)->data!=data && (*list)->next!=NULL)list=&((*list)->next);
    if((*list)->data==data){
        temp=*list;
        *list=(*list)->next;
        free(temp);
    }
}

Copy

lookup

Node * findnode(Node ** list,int data)// lookup , Return the pointer to the node , If no return is empty 
{
    while((*list)->data!=data && (*list)!=NULL) list=&((*list)->next);
    return *list;
}

Copy

Change value

void change(Node ** list,int data,int temp)// change 
{
    while((*list)->data!=data && (*list)->next!=NULL)list=&((*list)->next);
    if((*list)->data==data)(*list)->data=temp;
}

Copy

Final test

int main(void)// test 
{
    Node * head=NULL;
    Node ** gg=&head;
    int i;
    for(i=0;i<10;i++)pushback(gg,i);
    printf(" The list elements are in turn : ");
    printlist(head);
    printf(" The length is %d\n",lenlist(head));
    freelist(gg);
    printf(" The length after release is %d\n",lenlist(head));
    for(i=0;i<10;i++)pushback(gg,i);
    deletelist(gg,0);// head 
    deletelist(gg,9);// tail 
    deletelist(gg,5);
    deletelist(gg,100);// non-existent 
    printf(" Create the list again , After deleting a node \n");
    printlist(head);
    freelist(gg);
    for(i=0;i<5;i++)pushback(gg,i);
    insertlist(gg,5,0);// head 
    insertlist(gg,5,5);
    insertlist(gg,5,7);// tail 
    insertlist(gg,5,10);// non-existent 
    printlist(head);
    printf(" find %d\n hold 3 Turn into 100",*findnode(gg,5));
    change(gg,3,100);
    change(gg,11111,1);// non-existent 
    printlist(head);
}

Copy

Publisher ： Full stack programmer stack length , Reprint please indicate the source ：https://javaforall.cn/149821.html Link to the original text ：https://javaforall.cn