91超碰碰碰碰久久久久久综合_超碰av人澡人澡人澡人澡人掠_国产黄大片在线观看画质优化_txt小说免费全本

溫馨提示×

溫馨提示×

您好，登錄后才能下訂單哦！

密碼登錄×
登錄注冊×
其他方式登錄
點擊 登錄注冊 即表示同意《億速云用戶服務條款》

C++實現通用雙向鏈表

發布時間：2020-08-04 16:50:27 來源：ITPUB博客 閱讀：504 作者：gaopengtttt 欄目：互聯網科技
使用C++完成雙向通用鏈表
雙向鏈表不用多說，通用鏈表因為數據結構不確定的，使用一個VOID指針指向數據，
什么數據都可以掛上去，這樣來封裝鏈表，可以作為基礎類也可以單獨使用，
這里只是為了練習C++封裝的語法，實現了簡單的增加和刪除鏈表由于實際數據
類型不能確定，打印鏈表數據使用公有函數來完成，完成了正向打印反向打印，
演示了數據類型為簡單的int類型也演示了數據類型為class類型。
代碼如下：


點擊(此處)折疊或打開

  1. 鏈表實現：
  2. #include<iostream>
  3. #include<stdlib.h>
  4. using namespace std;
  5. /* data數據類型進行void封裝，為通用鏈表
  6.  * node為節點的基本數據結構
  7.  * addnode使用void數據進行連接到鏈表中，造成鏈表
  8.  * frist_node為第一個結點位置，開放訪問
  9.  * last_node為最后一個節點位置，開放訪問
  10.  * length為節點長度，開放訪問
  11.  * 只是完成增加節點和釋放節點功能，其他功能也相應簡單，用到再加，打印功能由于
  12.  * 數據類型不確定無法完成。
  13.  */
  14. #ifndef _CHAIN_
  15. #define _CHAIN_
  16. struct node
  17. {
  18.         void* data;
  19.         node* next;
  20.         node* priv;
  21.         unsigned int num;
  22.         node()
  23.         {
  24.                 data = NULL;
  25.                 next = NULL;
  26.                 priv = NULL;
  27.                 num = 0;
  28.         }
  29. };


  32. class my_chain
  33. {
  34.         public:
  35.                 my_chain()
  36.                 {

  38.                         this->frist_node = NULL;
  39.                         this->length = 0;
  40.                         this->last_node = NULL;
  41.                 }
  42. //-1 data is null;
  43. // 0 normal
  44. // 傳入一個void指針的數據類型,鏈表增加一個節點
  45.                 int addnode(void* data)
  46.                 {
  47.                         ret = 0 ;

  49.                         if(data == NULL)
  50.                         {
  51.                                 ret = -1;
  52.                                 return ret;
  53.                         }

  55.                         node* c_node = new node; //分配節點內存

  57.                         if(this->frist_node == NULL)
  58.                         {

  60.                                 this->frist_node = c_node;
  61.                         }
  62.                         if(this->last_node == NULL)
  63.                         {
  64.                                 c_node->next = NULL;
  65.                                 c_node->priv = NULL;
  66.                                 c_node->data = data;
  67.                         }
  68.                         else
  69.                         {
  70.                                 c_node->next = NULL;
  71.                                 c_node->priv = this->last_node;
  72.                                 this->last_node->next = c_node;
  73.                                 c_node->data = data;
  74.                         }
  75.                         this->last_node = c_node;
  76.                         this->length++;
  77.                         c_node->num = this->length;
  78.                         return ret;
  79.                 }
  80. //ret=1 null list;
  81. //ret=0 normal list;
  82. //釋放整個鏈表內存
  83.                 int freechain()
  84.                 {
  85.                         ret = 0;
  86.                         if(this->last_node == NULL)
  87.                         {
  88.                                 ret = 1;
  89.                                 cout<<"null list"<<endl;
  90.                                 return ret;
  91.                         }
  92.                         node* node_my = this->frist_node;
  93.                         while(node_my != NULL)
  94.                         {
  95. #ifdef DEBUG
  96.                                  cout<<"free node num:"<< node_my->num<<endl;
  97. #endif
  98.                                  node* temp = node_my;
  99.                                  node_my = node_my->next;
  100.                                  free(temp->data);//刪除節點數據內存？跨函數free
  101.                                  delete temp;//刪除節點node內存
  102.                         }
  103.                 }
  104. //....
  105.                 int delnode() //未實現
  106.                 {
  107.                         ret = 0;
  108.                         return ret;
  109.                 }

  111.                 int addmodnode(unsigned int loc)//未實現
  112.                 {
  113.                         ret = 0;
  114.                         return ret;
  115.                 }
  116. //.....

  118.         public:
  119.                  node* frist_node;//用于外部訪問
  120.                  unsigned int length;//用于外部訪問
  121.              node* last_node;//用于外部訪問
  122.         private:
  123.                  int ret;
  124. };
  125. #endif


點擊(此處)折疊或打開

  1. 測試用例：
  2. #include<iostream>
  3. #define DEBUG
  4. #include"chain.h"
  5. using namespace std;
  6. //測試類
  7. class cube
  8. {
  9.         public:
  10.                 cube(int a,int b,int c):a(a),b(b),c(c)
  11.         {
  12.                 ;
  13.         }
  14.                 int get_size() const
  15.                 {
  16.                         return a*b*c;
  17.                 }
  18.         private:
  19.                 int a;
  20.                 int b;
  21.                 int c;
  22. };
  23. //完成打印操作
  24. int printchain(my_chain* c_header)
  25. {
  26.         if(c_header->frist_node == NULL)
  27.         {
  28.                 cout<<"NULL chain" <<endl;
  29.                 return -1;
  30.         }
  31.         node* node_my = c_header->frist_node;
  32.    cout<<"chain total number:"<<c_header->length<<endl;

  34. //正向訪問
  35. cout<<"正向訪問"<<endl;
  36.         while(node_my != NULL)
  37.         {
  38.                 cout<<"node num:"<<node_my->num<<" data is:"<<*((int*)(node_my->data))<<endl;
  39.                 node_my = node_my->next;
  40.         }


  43.         node_my = c_header->last_node;
  44. //反向訪問
  45. cout<<"反向訪問"<<endl;
  46.         while(node_my != NULL)
  47.         {
  48.                 cout<<"node num:"<<node_my->num<<" data is:"<<*((int*)(node_my->data))<<endl;
  49.                 node_my = node_my->priv;
  50.         }
  51.         return 0;

  53. }

  55. int printchain_cube(my_chain* c_header)
  56. {
  57.         if(c_header->frist_node == NULL)
  58.         {
  59.                 cout<<"NULL chain" <<endl;
  60.                 return -1;
  61.         }
  62.         node* node_my = c_header->frist_node;
  63.         cout<<"chain total number:"<<c_header->length<<endl;
  64. //正向訪問
  65. cout<<"正向訪問"<<endl;
  66.         while(node_my != NULL)
  67.         {
  68.                 cout<<"node num:"<<node_my->num<<" data is:"<<((cube*)(node_my->data))->get_size()<<endl;
  69.                 node_my = node_my->next;
  70.         }

  72.         node_my = c_header->last_node;
  73. //反向訪問
  74. cout<<"反向訪問"<<endl;
  75.         while(node_my != NULL)
  76.         {
  77.                 cout<<"node num:"<<node_my->num<<" data is:"<<((cube*)(node_my->data))->get_size()<<endl;
  78.                 node_my = node_my->priv;
  79.         }

  81.         return 0;

  83. }

  85. int main()
  86. {
  87.         cout<<"---int data chain:"<<endl;
  88.         { //3個測試int數據
  89.                 my_chain* chain_int = new my_chain;//建立my_chain雙向鏈表頭
  90.                 int i = 0;
  91.                 for(i = 0;i<3;i++)
  92.                 {
  93.                         //最好使用malloc族函數使用free來釋放void類型內存
  94.                         int* data = (int*)calloc(1,sizeof(int));
  95.                         //int* data = new int(i);
  96.                         (*chain_int).addnode((void*)data);
  97.                 }
  98.                 printchain(chain_int);
  99. #ifdef DEBUG
  100.                 cout<<"釋放內存"<<endl;
  101. #endif
  102.                 (*chain_int).freechain();
  103.                 delete chain_int;
  104.         }
  105.    cout<<"---class data chain:"<<endl;
  106.         {//5個測試類數據
  107.                 my_chain* chain_cube = new my_chain;//建立my_chain雙向的鏈表頭
  108.                 int i = 0;
  109.                 for(i = 0;i<5;i++)
  110.                 {
  111.                         //cube* data = new cube(i,i,i);
  112.                         cube* data = (cube*)calloc(1,sizeof(cube));
  113.                         (*data)=cube(i,i,i);//默認淺拷貝，這里無礙
  114.                         (*chain_cube).addnode((void*)data);
  115.                 }
  116.                 printchain_cube(chain_cube);
  117. #ifdef DEBUG
  118.                 cout<<"釋放內存"<<endl;
  119. #endif
  120.                 (*chain_cube).freechain();
  121.                 delete chain_cube;
  122.         }

  124. }


點擊(此處)折疊或打開

  1. 測試結果：
  2. ---int data chain:
  3. chain total number:3
  4. 正向訪問
  5. node num:1 data is:0
  6. node num:2 data is:0
  7. node num:3 data is:0
  8. 反向訪問
  9. node num:3 data is:0
  10. node num:2 data is:0
  11. node num:1 data is:0
  12. 釋放內存
  13. free node num:1
  14. free node num:2
  15. free node num:3
  16. ---class data chain:
  17. chain total number:5
  18. 正向訪問
  19. node num:1 data is:0
  20. node num:2 data is:1
  21. node num:3 data is:8
  22. node num:4 data is:27
  23. node num:5 data is:64
  24. 反向訪問
  25. node num:5 data is:64
  26. node num:4 data is:27
  27. node num:3 data is:8
  28. node num:2 data is:1
  29. node num:1 data is:0
  30. 釋放內存
  31. free node num:1
  32. free node num:2
  33. free node num:3
  34. free node num:4
  35. free node num:5
內存泄露檢測：
==4624== 
==4624== HEAP SUMMARY:
==4624==     in use at exit: 0 bytes in 0 blocks
==4624==   total heap usage: 18 allocs, 18 frees, 392 bytes allocated
==4624== 
==4624== All heap blocks were freed -- no leaks are possible
==4624== 
==4624== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
==4624== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)


向AI問一下細節

免責聲明：本站發布的內容（圖片、視頻和文字）以原創、轉載和分享為主，文章觀點不代表本網站立場，如果涉及侵權請聯系站長郵箱：is@yisu.com進行舉報，并提供相關證據，一經查實，將立刻刪除涉嫌侵權內容。

AI
助
手
青阳县| 洞头县| 会昌县| 时尚| 彭泽县| 永德县| 措勤县| 靖边县| 千阳县| 洪湖市| 淄博市| 建平县| 通渭县| 合肥市| 文化| 通化县| 吉木乃县| 普安县| 兴城市| 邵阳县| 尚义县| 邢台市| 北流市| 沙田区| 盖州市| 泗水县| 苍梧县| 资中县| 德江县| 盐津县| 酒泉市| 遵义县| 郴州市| 常山县| 龙江县| 阿勒泰市| 佛坪县| 稻城县| 黄石市| 清徐县| 重庆市|