64,646
社区成员
发帖
与我相关
我的任务
分享
#ifndef _NODE_
#define _NODE_
struct slnode
{
int data;
slnode* next;
};
#endif
#include "node.h"
#include<iostream>
using namespace std;
// function prototype
slnode* build();
bool print(const slnode* h);
int main()
{
slnode* head;
head = build();
print (head);
}
// 创建单链表
slnode* build()
{
slnode* h = new slnode;
h->next = NULL;
slnode* q = h;
cout << "Enter numbers: \n";
int i = 1;
cout << "number #1" << ": ";
slnode* p = new slnode;
while(p != NULL && cin >> p->data) // 依次在尾部插入节点
{
p->next = NULL;
q->next = p;
q = p;
cout << "number #" << ++i << ": ";
slnode* p = new slnode;
}
return h;
}
bool print(const slnode* h)
{
slnode* p;
p = h->next;
while (p)
{
cout << p->data << ' ';
p = p->next;
cout << "ok";
}
cout << endl;
return 1;
}
slnode* build()
{
int data;
slnode* h = new slnode;
slnode* t = h;
int i=1;
t->next = NULL;
cout << "Enter numbers: \n";
cout << "number #1" << ": ";
while(cin>>data)
{
slnode* p= new slnode;
p->data = data;
p->next = NULL;
t->next = p;
t = p;
i++;
cout << "number #" << i << ": ";
}
return h;
}
bool print(const slnode* h)
{
slnode* p;
p = h->next;
while (p)
{
cout << p->data << ' ';
p = p->next;
cout << "ok\n";
}
cout << endl;
return 1;
}
// 创建单链表
slnode* build()
{
int data;
slnode* h = (slnode*)malloc(sizeof(slnode));
h->next = NULL;
slnode* q = h;
cout << "Enter numbers: \n";
int i = 1;
cout << "number #1" << ": ";
while(cin >> data!='#') // 依次在尾部插入节点
{
slnode* p = (slnode*)malloc(sizeof(slnode));
p->data = data; //把输入的值赋值给节点
q->next = p;
q = p;
cout << "number #" << ++i << ": ";
}
q->next = NULL;
return h;
}
#ifndef _NODE_
#define _NODE_
struct slnode
{
int data;
slnode* next;
slnode(int data_):data(data_),next(0){}
};
#endif
#include<iostream>
using namespace std;
slnode* build();
bool print(slnode* h);
int main()
{
slnode* head;
head = build();
print (head);
}
// 创建单链表
slnode* build()
{
int data;
slnode* h = new slnode(0);
slnode* q = h;
cout << "Enter numbers: \n";
int i = 1;
cout << "number #1" << ": ";
while(cin >> data) // 依次在尾部插入节点
{
slnode* p = new slnode(data);
q->next = p;
q = q->next;
cout << "number #" << ++i << ": ";
}
return h;
}
bool print(slnode* h)
{
slnode* p;
p = h->next;
while (p)
{
cout << p->data << ' ';
p = p->next;
cout << "ok";
}
cout << endl;
return 1;
}
I:\>g++ test.cpp
I:\>a
Enter numbers:
number #1: 1
number #2: 2
number #3: 3
number #4: 4
number #5: ^Z
1 ok2 ok3 ok4 ok
I:\>