c語言之鏈表（完整版）

• • • 鏈表（完整版）

全國新增確診連續(xù)兩天為0 喜迎遍地飄零的時(shí)刻 海外游子也在回家 一起加油！

鏈表（完整版）

此版包括以下功能：

鏈表創(chuàng)建、
頭插、
尾插、
刪除、
翻轉(zhuǎn)、
刪除相同元素、
遍歷、
判斷鏈表是否為空

以下為源碼
若有不嚴(yán)謹(jǐn)?shù)牡胤?#xff0c;歡迎指正

//鏈表創(chuàng)建、頭插、尾插、刪除、翻轉(zhuǎn)、刪除相同元素、遍歷、判斷鏈表是否為空 #include<stdio.h> #include<stdlib.h> typedef struct Node{int data;struct Node *next; }Node; int main(){//主函數(shù)中不能指定一個(gè)頭指針，應(yīng)該定義一個(gè)頭指針指向頭結(jié)點(diǎn)Node *head = (Node*)malloc(sizeof(Node));head -> next = NULL;createLink(head,10);//創(chuàng)建鏈表travelLink(head);//遍歷鏈表insertForward(head,100);//頭插法insertBack(head,200);//尾插法travelLink(head);//遍歷鏈表deleteSame(head);//刪除相同元素travelLink(head);//遍歷鏈表reverseLink(head);//翻轉(zhuǎn)鏈表元素travelLink(head);//遍歷鏈表deleteLink(head);//刪除鏈表isEmpty(head);//判斷鏈表是否為空return 0; } //創(chuàng)建鏈表 void createLink(Node *head,int size){Node *rear = head;int i;for(i = 0;i < size;++i){Node *newnode = (Node*)malloc(sizeof(Node));newnode -> next = NULL;scanf("%d",&newnode->data);rear -> next = newnode;rear = newnode;} } //遍歷鏈表 void travelLink(Node *head){Node *p = head -> next;while(p != NULL){printf("%d\t",p->data);p = p -> next;}putchar('\n'); } //頭插法 void insertForward(Node *head,int data){Node *newnode = (Node*)malloc(sizeof(Node));newnode -> next = NULL;newnode -> data = data;newnode -> next = head -> next;head -> next = newnode; } //尾插法 void insertBack(Node *head,int data){Node *newnode = (Node*)malloc(sizeof(Node));newnode -> next = NULL;newnode -> data = data;Node *p = head;while(p->next != NULL){p = p -> next;}p -> next = newnode;p = newnode; } //刪除相同元素 void deleteSame(Node *head){Node *curr = head -> next;while(curr != NULL){Node *pre = curr;Node *p = curr -> next;while(p != NULL){//若有相同的元素，則刪除；否則兩個(gè)指針繼續(xù)向下走if(curr->data == p->data){pre -> next = p -> next;free(p);p = pre -> next;}else{pre = pre -> next;p = p -> next;}}curr = curr -> next;} } //翻轉(zhuǎn)鏈表 void reverseLink(Node *head){Node *curr;Node *pre = NULL;while(head -> next != NULL){curr = head -> next;head -> next = curr -> next;curr -> next = pre;pre = curr;}head -> next = pre; } //刪除鏈表 void deleteLink(Node *head){Node *curr;while(head -> next != NULL){curr = head -> next;head -> next = curr -> next;free(curr);} } //判斷鏈表是否為空 void isEmpty(Node *head){if(head -> next == NULL){printf("鏈表為空！\n");}else{printf("鏈表不為空！\n");} }

運(yùn)行結(jié)果

總結(jié)

以上是生活随笔為你收集整理的【c语言】链表（完整版）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。