|
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
#include <iostream>
#include <vector>
#include <algorithm>
#define pii pair<int, int>
using namespace std;
class node
{
public:
int data;
node* next;
};
class list
{
private:
node* head = NULL;
node* tail = NULL;
int size = 0;
public:
void init()
{
node* tmp = head;
while (tmp != NULL)
{
head = tmp->next;
delete tmp;
tmp = head;
}
delete head;
}
void add(int data)
{
node* newnode = new node;
newnode->data = data;
newnode->next = NULL;
size++;
if (head == NULL)
head = newnode;
else
tail->next = newnode;
tail = newnode;
}
void add(int data, int pos) // n번째에 삽입
{
if (pos == size) // 끝 삽입
add(data);
else if (pos < size) // 시작 ~ 중간
{
node* newnode = new node;
newnode->data = data;
newnode->next = NULL;
node* tmpprev = head;
node* tmp = head;
for (int i = 0; i < pos; i++) // 0번 이동시킬때 치명적
{
tmpprev = tmp;
tmp = tmp->next;
}
size++;
newnode->next = tmp;
if (pos == 0)
head = newnode;
else
tmpprev->next = newnode;
}
else
cout << "error input pos";
}
void del()
{
node* tmpprev = head;
node* tmp = head;
while (tmp != NULL)
{
tmpprev = tmp;
tmp = tmp->next;
cout << tmpprev->data << "를 삭제합니다." << '\n';
delete tmpprev;
}
head = NULL;
tail = NULL;
size = 0;
}
void del(int pos) // 잘 안쓸꺼임
{
if (pos <= size - 1)
{
node* tmpprev = head;
node* tmp = head;
for (int i = 0; i < pos; i++)
{
tmpprev = tmp;
tmp = tmp->next;
}
if (pos == 0)
head = tmp->next;
else if (pos == size - 1)
{
tmpprev->next = NULL;
tail = tmpprev;
}
else
tmpprev->next = tmp->next;
size--;
delete tmp;
}
else
cout << "error del pos";
}
void show()
{
node* tmp = head;
while (tmp != NULL)
{
cout << tmp->data << "=>";
tmp = tmp->next;
}
cout << '\n';
}
};
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
list l;
l.add(10); l.show();
l.add(20); l.show();
l.add(30); l.show();
l.add(40); l.show();
l.add(50); l.show();
l.del();
}
|
cs |
'알고리즘 기술' 카테고리의 다른 글
| lower_bound, upper_bound 코드 (0) | 2020.06.22 |
|---|---|
| 피보나치 수 를 log2(N) 빠르기로 구하기. (0) | 2020.06.12 |
| 유클리드 호제법 (0) | 2020.06.11 |
| nPr nCr 기본 (0) | 2020.06.09 |
| 정렬 (0) | 2020.06.09 |