Repository navigation
Expand file tree
/
Copy pathlist.c
More file actions
116 lines (101 loc) · 1.45 KB
/
Copy pathlist.c
File metadata and controls
116 lines (101 loc) · 1.45 KB
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
#include "list.h"
void init_list(LinkList* L)
{
*L = (LinkList)malloc(sizeof(struct LinkNode));
(*L)->data = 0;
(*L)->next = NULL;
}
LinkList init_list_2(LinkList L)
{
L = (LinkList)malloc(sizeof(struct LinkNode));
L->data = 0;
L->next = NULL;
return L;
}
void destroy(LinkList* L)
{
clear(*L);
free(*L);
*L = NULL;
}
void debug(LinkList L)
{
LinkList p = L->next;
while(p)
{
printf("%d ", p->data);
p = p->next;
}
printf("\n");
}
int get_length(LinkList L)
{
LinkList p = L->next;
int cnt = 0;
while(p)
{
++cnt;
p = p->next;
}
return cnt;
}
int is_empty(LinkList L)
{
return L->next == NULL;
}
int get_value(LinkList L, int pos, int *data)
{
LinkList p = L->next;
int ix = 0;
while(p && ix < pos)
{
p = p->next;
++ix;
}
if (p)
{
*data = p->data;
return 0;
}
return -1;
}
void create_list_head(LinkList L, int *arr, int n)
{
int ix = 0;
LinkList tmp;
for(ix = 0; ix < n; ix++)
{
tmp =(LinkList)malloc(sizeof(struct LinkNode));
tmp ->data = arr[ix];
tmp->next = L->next;
L->next = tmp;
}
}
void create_list_tail(LinkList L, int *arr, int n)
{
LinkList tail = L;
LinkList tmp;
int ix;
for(ix = 0; ix != n; ++ix)
{
tmp =(LinkList)malloc(sizeof(struct LinkNode));
tmp ->data = arr[ix];
tail->next = tmp;
tail = tmp;
}
tail->next = NULL;
}
int insert_element(LinkList, int, int)
{
}
void clear(LinkList L)
{
LinkList p = L->next;
LinkList q;
while(p)
{
q = p;
p = p->next;
free(q);
}
}