不帶頭結(jié)點(diǎn)的節(jié)點(diǎn)因?yàn)椴迦雱h除的時候會改變或者刪除第一個節(jié)點(diǎn)，所以要引入二級指針進(jìn)行一系列的操作

---

頭文件

#pragma once //不帶頭結(jié)點(diǎn)的單鏈表 typedef struct Node {int data;//數(shù)據(jù)Node * next;//存放下一個元素的地址 }Node; //初始化 void InitList(Node **ps); //頭插 bool Insert_Head(Node **ps,int val); //尾插 bool Insert_Tail(Node **ps,int val); //按位置插入 bool Insert_Pos(Node **ps,int pos,int val); //刪除某個節(jié)點(diǎn) bool Delete_Node(Node **ps,int key); //刪除整個鏈表 bool Delete_List(Node **ps); //查找 Node *Search(Node *ps,int key); //鏈表長度 int GetLength(Node *ps); //打印鏈表的值 void Show(Node* ps);

---

cpp文件

#include<iostream> #include<assert.h> #include"NoList.h" using namespace std;void InitList(Node* *ps) {assert(ps != NULL);*ps = NULL; }static Node* BuyNode(int val) {Node *pnewnode = new Node();pnewnode->data = val;pnewnode->next = NULL;return pnewnode; } bool Insert_Head(Node* *ps,int val) {assert(ps != NULL);Node* pnewnode = BuyNode(val);pnewnode->next = *ps;*ps = pnewnode;return true; }bool Insert_Tail(Node* *ps,int val) {assert(ps != NULL);Node* pnewnode = BuyNode(val);Node* pTail = *ps;if(pTail == NULL){*ps = pnewnode;//}else{ while(pTail->next != NULL){pTail = pTail->next;}pTail->next = pnewnode;}return true; }bool Insert_Pos(Node* *ps,int pos,int val) {assert(ps != NULL);Node * q = *ps;for(int i = 0;i<pos;i++){q = q->next;}Node *p =BuyNode(val);p->next = q->next;q->next = p;return true; }bool Delete_Node(Node* *ps,int key) {assert(ps != NULL);Node* p = Search(*ps,key);if(p == NULL){return false;}//刪除的節(jié)點(diǎn)是第一個節(jié)點(diǎn)也是最后一個節(jié)點(diǎn)if(p == *ps){delete p;p = NULL;/ps = NULL;/}//刪除的節(jié)點(diǎn)不是尾結(jié)點(diǎn)else if(p->next != NULL){Node * q = p->next;p->data = q->data;p->next = q->next;delete q;q = NULL;}//節(jié)點(diǎn)有很多，刪除的節(jié)點(diǎn)是尾結(jié)點(diǎn)else if(p ->next == NULL){Node* q = *ps;for(;q->next!= NULL;q = q->next);/*q ->next = NULL;q->next ->data = NULL;delete (q->next);*/q ->next = NULL;delete (q->next);p = NULL;}return true; }bool Delete_List(Node* *ps) {assert(ps != NULL);Node* p;//Node* q = p;while(*ps != NULL){p = *ps;*ps = p->next;delete p;}return true; }Node* Search(Node* ps,int key) {assert(ps != NULL);Node * q = ps;while(q != NULL){if(key == q->data){return q;}q = q->next;}return NULL; }int GetLength(Node *ps) {assert(ps != NULL);int length = 0;for(Node* q = ps;q!= NULL;q = q->next){length++;}return length; }void Show(Node* ps) {for(Node *q = ps;q!= NULL;q= q->next){cout << q->data << " " ;}cout <<endl; }

---

主函數(shù)

#include<iostream> #include<assert.h> #include"NoList.h" using namespace std;int main() {Node* head;InitList(&head);/*for(int i = 0;i<10;i++){Insert_Head(&head,i);}*/for(int i = 0;i<10;i++){Insert_Tail(&head,i,i);}Show(*&head);cout << GetLength(head) << endl;Insert_Pos(&head,5,111);Show(*&head);cout << GetLength(head) << endl;Delete_Node(&head,5);Show(head);cout << GetLength(head) << endl;Delete_List(&head);Show(head);return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的单链表（不带头结点）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

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