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
|
#include <iostream>
#include "queue.h"
using namespace std;
void result(queue *&h, queue *&t, queue *&hr, queue *&tr)
{
int prev;
prev = pop(h, t);
push(hr, tr, prev);
while (h)
{
int cur = pop(h, t);
if (cur != prev)
{
prev = cur;
push(hr, tr, cur);
}
}
}
int main()
{
int n;
cout << "n = ";
cin >> n;
queue *head = NULL;
queue *tail = NULL;
int x;
for (int i = 0; i < n; i++)
{
cin >> x;
push(head, tail, x);
}
queue *head_res = NULL;
queue *tail_res = NULL;
result(head, tail, head_res, tail_res);
while (head_res)
cout << pop(head_res, tail_res) << " ";
cout << endl;
return 0;
}
|
