-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathlink_list1.cpp
82 lines (78 loc) · 1.37 KB
/
link_list1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <iostream>
using namespace std;
struct list
{
int data;
struct list *next;
};
list *start;
void createnode()
{
int n;
cin >> n;
list *newnode;
newnode = new list;
newnode->data = n;
if (start == NULL)
{
start = newnode;
start->next = NULL;
}
list *temp;
temp = start;
while (temp->next != NULL)
{
temp = temp->next;
}
temp->next = newnode;
newnode->next = NULL;
}
void traverselist(list *start)
{
list *temp = start;
while (temp != NULL)
{
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
list *Rever(list *start)
{
list *temp = NULL;
list *nextNode = NULL;
while (start)
{
nextNode = start->next;
start->next = temp;
temp = start;
start = nextNode;
}
return temp;
}
int main()
{
do
{
cout << "1.create 2.traverse 3.exit 4.reverse " << endl;
int ch;
cin >> ch;
if (ch == 1)
{
createnode();
}
if (ch == 2)
{
traverselist(start);
}
if (ch == 3)
{
exit(0);
}
if (ch == 4)
{
start = Rever(start);
}
} while (1);
return 0;
}