-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedList.c
99 lines (65 loc) · 1.71 KB
/
linkedList.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
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
typedef struct node *nodePtr;
typedef struct node{ int value; nodePtr next;} node;
nodePtr makeList(nodePtr listPointer);
int size(nodePtr listPointer);
void removeNode(nodePtr listPointer);
int main (int argv,char* argc[]){
nodePtr list = malloc(sizeof(node));
assert(list != NULL);
list = makeList(list);
int listSize = size(list);
printf("\n\n%d\n",listSize);
removeNode(list);
removeNode(list);
listSize = size(list);
printf("\n\n%d\n",listSize);
return 0;
}
nodePtr makeList(nodePtr listPointer){
int counter = 1;
listPointer->value=0;
listPointer->next=NULL;
while(counter<10){
nodePtr temp = malloc(sizeof(node));
assert(temp!=NULL);
temp->value= counter;
temp->next = listPointer;
listPointer = temp;
counter++;
}
return listPointer;
}
int size(nodePtr listPointer){
int listSize = 0;
nodePtr temp = listPointer;
while(temp){
printf("\n%d",temp->value);
temp=temp->next;
listSize++;
}
return listSize;
}
void removeNode(nodePtr listPointer){
int nodeNumber=0;
printf("\nPlease enter node number to remove: ");
scanf("%d",&nodeNumber);
int counter=0;
nodePtr temp = listPointer;
nodePtr temp2;
while(counter<nodeNumber-1 && temp){
temp = temp->next;
temp2 = temp->next;
counter++;
}
free(temp);
temp = listPointer;
counter = 0;
while(counter<nodeNumber-2){
temp=temp->next;
counter++;
}
temp->next = temp2;
}