表、栈、队列联系

来源：互联网发布：淘宝美版ac68u 编辑：程序博客网时间：2024/06/08 08:27

3.1编写打印出一个单链表的所有元素的程序。

#include"iostream"using namespace std;typedef struct Node{    int number;    struct Node* next;}Node;//初始化单链表Node* chushihuaNode() {    Node* first;    first = new Node();    if (first == NULL) {        cout << "初始化失败";        exit(0);    }    first->next = NULL;    return first;}//头插法赋值void touaddNode(int number,Node* first) {    Node* temp;    temp = new Node();    temp->number = number;    temp->next = first->next;    first->next = temp;}//尾查法赋值void weiaddNode(int number, Node* first) {    Node* temp = first;    while (temp->next != NULL) {        temp = temp->next;    }    Node* last = new Node();    last->number = number;    last->next = NULL;    temp->next = last;}void outnumber(Node* first) {    Node* temp = first;    while (temp->next != NULL) {        temp = temp->next;        cout << temp->number << endl;    }}int main() {    int k;    Node* first = chushihuaNode();    for (int i = 0; i < 2; i++) {        cin >> k;        weiaddNode(k,first);    }           outnumber(first);}

阅读全文

0 0