blob: ef5e021871a9901f0a0035cebfabe44b2d822d7d (
plain)
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
|
// Implementation of a Linked List
//
// TODO: recursive implementation for llfree
//
#include <stdio.h>
#include <stdlib.h>
#include "ll.h"
Node* llnode(int value) {
Node* n = (Node*) malloc(sizeof(Node));
n->value = value;
n->next = NULL;
return n;
}
void llprint(Node* head) {
Node* node = head;
printf("[ ");
while (node != NULL) {
printf("%i ", node->value);
node = node->next;
}
printf("]\n");
free(node);
}
void llvprint(Node* head) {
Node* node = head;
while (node != NULL) {
printf("[*] %i\n", node->value);
node = node->next;
printf(" |\n");
}
printf("[/] %s\n", (char*) node);
}
int lllength(Node* head) {
Node* n = head;
int i = 0;
for (; n != NULL; ++i) n = n->next;
return i;
}
void llpush(Node** head, int value) {
Node* n = llnode(value);
n->next = *head;
*head = n;
}
int llpop(Node** head) {
int val = (*head)->value;
*head = (*head)->next;
return val;
}
void llappend(Node* head, int value) {
Node* n = head;
while (n->next != NULL) n = n->next;
n->next = llnode(value);
}
void llinsert(Node** head, int value, int index) {
Node* n = *head;
Node* cur = NULL;
Node* node = llnode(value);
int i = 0;
while (n->next != NULL && i < index) {
cur = n;
n = n->next;
++i;
}
cur->next = node;
node->next = n;
}
void llfree(Node** head) {
while (*head != NULL) {
Node* n = *head;
*head = (*head)->next;
free(n);
}
*head = NULL;
}
int llrmlast(Node** head) {
Node* n = *head;
Node* cur = NULL;
while (n->next != NULL) {
cur = n;
n = n->next;
}
int val = n->value;
cur->next = NULL;
free(n);
return val;
}
int llrm(Node** head, int index) {
Node* n = *head;
Node* cur = NULL;
if (index == -1) {
while (n->next != NULL) {
cur = n;
n = n->next;
}
} else {
int i = 0;
while (n->next != NULL && i < index) {
cur = n;
n = n->next;
++i;
}
}
cur->next = n->next;
int val = n->value;
free(n);
return val;
}
|
