-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path19 fix.cpp
More file actions
84 lines (75 loc) · 1.31 KB
/
19 fix.cpp
File metadata and controls
84 lines (75 loc) · 1.31 KB
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
83
84
#include <iostream>
using namespace std;
struct Node
{
int x;
Node *Next;
};
class Queue
{
Node *Head,*Tail;
public:
Queue(){
Head=NULL;
Tail=NULL;
}
~Queue();
void Show();
void Add(int x);
};
void Queue::Add(int x){
if (Head!=NULL)
{
Node *temp=Head;
while ((temp->Next!=NULL) && (temp->Next->x<=x))
temp=temp->Next;
if (temp->Next==NULL){
Node *tempy=new Node;
tempy->x=x;
tempy->Next=NULL;
temp->Next=tempy;
Tail=tempy;
}
else{
Node *tempy=new Node;
tempy->x=x;
tempy->Next=temp->Next;
temp->Next=tempy;
}
}
else
{
Node *tempy=new Node;
tempy->Next=NULL;
tempy->x=x;
Tail=tempy;
Head=Tail;
}
}
void Queue::Show()
{
Node *temp=Head;
while (temp!=NULL)
{
cout<<temp->x<<" ";
temp=temp->Next;
}
cout <<endl;
}
Queue::~Queue()
{
while (Head)
{
Tail=Head->Next;
delete Head;
Head=Tail;
}
}
int main(){
Queue Q;
for (int i=0;i<10;i++){
Q.Add(rand());
//cout <<1;
}
Q.Show();
}