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
|
#include <stdio.h>
#include <stdlib.h>
typedef struct Data {
int data;
struct Data* pNext;
}linkedList;
typedef struct {
struct Data* head;
struct Data* tail;
}linkHeader;
void createNode(linkHeader *L, int pData) {
linkedList *newNode = (linkedList*)malloc(sizeof(linkedList));
newNode->data = pData;
newNode->pNext = NULL;
if (L->head == NULL && L->tail == NULL) {
L->head = L->tail = newNode;
return;
}
else {
L->tail->pNext = newNode;
L->tail = newNode;
}
}
void deleteNode(linkHeader *L, int pData) {
linkedList *temp = L->head;
linkedList *preNode = NULL;
if (temp->data == pData) {
L->head = temp->pNext;
delete temp;
}
else {
while (temp != NULL) {
if (temp->data == pData) {
preNode->pNext = temp->pNext;
delete temp;
break;
}
preNode = temp;
temp = temp->pNext;
}
}
}
void printNode(linkHeader *L) {
linkedList* P = L->head;
printf("[");
while (P != NULL){
printf("%d", P->data);
P = P->pNext;
if (P != NULL) {
printf(",");
}
}
printf("]\n");
}
int main(void) {
linkHeader *L = (linkHeader*)malloc(sizeof(linkHeader));
L->head = NULL;
L->tail = NULL;
int num = 0;
int insertNum = 0;
int deleteNum = 0;
while (1) {
printf("실행할 작업의 번호를 입력하세요.\n 1.입력\n 2.삭제\n 3.전체출력\n 4.끝내기\n");
scanf("%d", &num);
switch (num)
{
case 1:
printf("넣을 숫자를 입력하세요 : ");
scanf("%d", &insertNum);
createNode(L, insertNum);
printNode(L);
break;
case 2:
if (L->head == NULL && L->tail == NULL) {
printf("비어있습니다.\n");
return 0;
}
else {
printf("삭제할 숫자를 입력하세요 : ");
scanf("%d", &deleteNum);
deleteNode(L, deleteNum);
printNode(L);
}
break;
case 3:
if (L->head == NULL && L->tail == NULL) {
printf("비어있습니다.\n");
return 0;
}
else {
printNode(L);
}
break;
case 4:
printf("끝내기.\n");
return 0;
}
}
return 0;
}
| cs |
2016년 8월 29일 월요일
C - LinkedList
피드 구독하기:
댓글 (Atom)
댓글 없음:
댓글 쓰기