안선생의 개발 블로그
double link 본문
|
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
#include<iostream>
using namespace std;
struct Node
{
Node* prev;
int data;
Node* next;
}*first=NULL;
void create(int a[], int n)
{
Node* t, *last;
int i = 0;
first = new Node;
first->data = a[0];
first->prev = first->next = NULL;
last = first;
for (i=1; i < n; i++)
{
t = new Node;
t->data=a[i];
t->next = last->next;
t->prev = last;
last->next = t;
last = t;
}
}
void Display(Node* p)
{
while (p)
{
cout << p->data << " ";
p = p->next;
}
}
int Length(Node* p)
{
int count = 0;
while (p)
{
count++;
p = p->next;
}
return count;
}
void Insert(Node* p, int index, int x)
{
Node* t = new Node;
Node* q=NULL;
if (index <0 || index> Length(first))
return;
if (index == 0)
{
t->data = x;
t->next = first;
t->prev = NULL;
first->prev = t;
first = t;
}
else
{
for (int i = 0; i < index - 1; i++)
p = p->next;
t->data = x;
t->next = p->next;
t->prev = p;
if (p->next)
p->next->prev = t;
p->next = t;
}
}
int Delete(Node* p, int index)
{
int i = 0;
int x = -1;
Node* q;
if (index<1 || index> Length(first))
return x;
if (index == 1)
{
x = p->data;
p = p->next;
delete first;
first = p;
first->prev = NULL;
return x;
}
else
{
for (i = 0; i < index - 2; i++)
p = p->next;
q = p->next;
p->next = q->next;
if (p->next)
p->next->prev = p;
x = q->data;
delete q;
return x;
}
}
void Reverse(Node* p)
{
Node* temp;
while (p)
{
temp = p->next;
p->next = p->prev;
p->prev = temp;
p = p->prev;
if (p != NULL && p->next == NULL)
first = p;
}
}
int main()
{
int a[] = {1,2,3,4,5};
create(a, 5);
//Insert(first,5, 1);
//cout<< Delete(first, 1);
Reverse(first);
Display(first);
return 0;
}
|
cs |