C++ linked list

最新推荐文章于 2024-06-26 11:27:35 发布

翻译最新推荐文章于 2024-06-26 11:27:35 发布 · 1.3k 阅读

Data Structure 专栏收录该内容

58 篇文章

订阅专栏

本文介绍了一种使用C++构建链表的方法，包括正向构建和反向构建两种方式，并展示了如何通过输入一系列整数来创建链表。此外，还提供了完整的代码示例和运行结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//C++: linked list
#include <iostream>
#include <cstdlib> // for system("PAUSE")
#include <iomanip>
using namespace std;

struct nodeType {
   int info;
   nodeType* link;
}; // 不要忘了分号
nodeType* buidListForward();
nodeType* buildListBackward();

int main() {
   nodeType* head;
   nodeType* current;
   head = buildListBackward();
   current = head;
   cout << "list = ";

   int count = 0;
   while(current != NULL) {
       cout << setw(5) << current -> info;
       count++;
       if(count % 10 == 0)
          cout << endl;
       current = current -> link;

   }

   system("PAUSE");
   return 0;
}

//build a linked list forward
nodeType* buildListForward() {
   nodeType *first, *last, *newNode;
   int num;
   cout << "Enter a list of integers ending with -999"
        << endl;
   cin >> num;
   first = NULL;
   while (num != -999) {
      newNode = new nodeType;
      newNode -> info = num;
      newNode -> link = NULL;

   //insert the new node
   if(first == NULL) {
      first = newNode;
      last = newNode;
   }
   else {
      newNode -> link = first;
      first = newNode;
   }
   cin >> num;
   }
   return first;

}


//build a list backward
nodeType* buildListBackward() {
   nodeType *first, *newNode;
   int num;
   cout << "Enter a list of integers ending with -999"
        << endl;
   cin >> num;
   first = NULL;

   while (num != -999) {
      newNode = new nodeType;
      newNode -> info = num;
      newNode -> link = first;

      first = newNode;
      cin >> num;
   }
   return first;

}

运行结果如下：