그 외 공부/Algorithm
# 1_SLL(Singly Linked List)
ssangeun
2017. 11. 5. 17:22
# The source code
|
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 |
#include<stdio.h>
#include<stdlib.h>
struct node{
int i;
struct node *next;
};
struct node *head = 0;
void addSLL(int v)
{
struct node * cur = (struct node *)malloc(sizeof(struct node));
cur->i = v;
cur->next = 0;
if (head == 0)
{
head = cur;
return;
}
else
{
struct node *tmp = head;
while (tmp->next != 0)
{
tmp = tmp->next;
}
tmp->next = cur;
return;
}
}
void delSLL(int v)
{
struct node *n_tmp = head;
struct node *tmp = 0;
if (head->i == v)
{
tmp = head;
head = tmp->next;
free(tmp);
return;
}
while (n_tmp != 0)
{
if (n_tmp->next->i == v)
{
tmp = n_tmp->next;
n_tmp->next = tmp->next;
free(tmp);
break;
}
n_tmp = n_tmp->next;
}
return;
}
void destroySLL()
{
struct node *tmp = head;
struct node *cur = tmp;
while (head != 0)
{
tmp = head;
head = tmp->next;
free(tmp);
}
}
void insertSLL(int v1, int v2)
{
struct node * tmp = head;
struct node * newone = (struct node *)malloc(sizeof(struct node));
newone->i = v2;
newone->next = 0;
while (tmp != 0)
{
if (tmp->i == v1)
{
newone->next = tmp->next;
tmp->next = newone;
break;
}
tmp = tmp->next;
}
return;
}
void printSLL()
{
struct node * cur = head;
while (cur != 0)
{
printf("%d, ", cur->i);
cur = cur->next;
}
return;
}
void main(void)
{
addSLL(1);
addSLL(2);
addSLL(3);
printf("SLL after adding 1,2,3 :");
printSLL();
destroySLL();
addSLL(4);
addSLL(5);
addSLL(6);
printf("\n SLL after destroying 1,2,3 and adding 4,5,6 :");
printSLL();
insertSLL(6, 10);
printf("\n SLL after inserting 6 in front of 10 :");
printSLL();
delSLL(6);
printf("\n SLL after deleting 6 :");
printSLL();
} |
cs |
# The result
