-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.c
185 lines (157 loc) · 4.38 KB
/
list.c
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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
/*************************************************************************
> File Name: insert.c
> Author:
> Mail:
> Created Time: 2015年11月08日 星期日 11时08分06秒
************************************************************************/
#include<stdio.h>
#include<stdlib.h>
/*定义节点*/
struct ListNode{
int data;
struct ListNode *nextNodePtr;
};
/*重命名*/
typedef struct ListNode ListNode;
typedef ListNode *ListNodePtr;
/*函数声明*/
void insert(ListNodePtr *sPtr,int value);
int delete(ListNodePtr *sPtr,int value);
int isEmpty(ListNodePtr sPtr);
ListNodePtr Find(ListNodePtr sPtr,int value);
ListNodePtr FindPrevious(ListNodePtr sPtr,int value);
void printList(ListNodePtr sPtr);
void instructions(void);
/*主函数*/
int main(void){
ListNodePtr startPtr = NULL;
int choice;
int item;
instructions();
printf("?");
scanf("%d",&choice);
while(choice != 3){
switch(choice){
case 1:
printf("Enter a number:\n");
scanf("%d",&item);
insert(&startPtr,item);
printList(startPtr);
break;
case 2:
if(isEmpty(startPtr)){
printf("List is empty\n\n");
}else{
printf("Enter a number to be deleted:\n");
scanf("%d",&item);
delete(&startPtr,item);
printList(startPtr);
}
break;
default:
printf("Invalid choice\n\n");
instructions();
break;
}
printf("?");
scanf("%d",&choice);
}
printf("End of run\n");
return 0;
}
/*instructions*/
void instructions(void){
printf("Please input you choice:\n"
"1 to insert element into list\n"
"2 to delete element from list\n"
"3 to end\n");
}
/*insert*/
void insert(ListNodePtr *sPtr,int value){
ListNodePtr newPtr;
ListNodePtr previousPtr;
ListNodePtr currentPtr;
newPtr = malloc(sizeof(ListNode));
if(newPtr != NULL){
newPtr->data = value;
newPtr->nextNodePtr = NULL;
previousPtr = NULL;
currentPtr = *sPtr;
while(currentPtr != NULL && value < currentPtr->data){
previousPtr = currentPtr;
currentPtr = currentPtr->nextNodePtr;
}
if(previousPtr == NULL){
newPtr->nextNodePtr = *sPtr;
*sPtr = newPtr;
}else{
previousPtr->nextNodePtr = newPtr;
newPtr->nextNodePtr = currentPtr;
}
}else{
printf("%d not inserted. No memory available\n",value);
}
}
/*delete*/
int delete(ListNodePtr *sPtr,int value){
ListNodePtr previousPtr;
ListNodePtr currentPtr;
ListNodePtr tempPtr;
if((*sPtr)->data == value){
tempPtr = *sPtr;
*sPtr = (*sPtr)->nextNodePtr;
free(tempPtr);
return value;
}else{
previousPtr = *sPtr;
currentPtr = (*sPtr)->nextNodePtr;
while(currentPtr != NULL && value != currentPtr->data){
previousPtr = currentPtr;
currentPtr = currentPtr->nextNodePtr;
}
if(currentPtr != NULL){
tempPtr = currentPtr;
previousPtr->nextNodePtr = currentPtr->nextNodePtr;
free(tempPtr);
return value;
}else{
printf("%d not found\n",value);
return value;
}
}
}
/*isEmpty*/
int isEmpty(ListNodePtr sPtr){
return sPtr == NULL;
}
/*printList*/
void printList(ListNodePtr currentPtr){
if(currentPtr == NULL){
printf("List is empty\n\n");
}else{
printf("The list is:\n");
while(currentPtr != NULL){
printf("%d -->",currentPtr->data);
currentPtr = currentPtr->nextNodePtr;
}
printf("NULL\n\n");
}
}
/*Find*/
ListNodePtr Find(ListNodePtr sPtr,int value){
ListNodePtr currentPtr;
currentPtr = sPtr;
while(currentPtr != NULL && currentPtr->data != value){
currentPtr = currentPtr->nextNodePtr;
}
return currentPtr;
}
/*FindPrevious*/
ListNodePtr FindPrevious(ListNodePtr sPtr,int value){
ListNodePtr currentPtr;
currentPtr = sPtr;
while(currentPtr != NULL && currentPtr->nextNodePtr->data != value){
currentPtr = currentPtr->nextNodePtr;
}
return currentPtr;
}