C语言 数据结构 链表 基本操作代码_c语言数据结构链表代码

#include <stdio.h>
#include <stdlib.h>
#define DataType int


/*
 * LinkedList
 */

typedef struct node {
    DataType data;
    struct node* next;
}LinkList;

void initList(LinkList *list) {
    if (list != NULL) {
        list = (LinkList*) malloc(sizeof(LinkList));
    }
}

void addHead(LinkList *list, int data) {
    if (list == NULL) {
        initList(list);
    }
    LinkList *p;
    p = (LinkList*) malloc(sizeof(LinkList));
    p -> data = data;
    p -> next = list -> next;
    list -> next = p;
}

LinkList* createLinkListByTail(int data[]) {
    int size = sizeof(data) / sizeof(int);
    LinkList *list;
    LinkList *tail, *temp;
    for(int i = 0;i < size;i ++) {
        int d = data[i];
        temp = (LinkList*) malloc(sizeof(LinkList));
        temp -> data = d;
        if(list == NULL) {
            list = temp;
            tail = temp;
        } else {
            tail -> next = temp;
            tail = temp;
        }
    }
    return list;
}

int getLength(LinkList* list) {
    int length = 0;
    LinkList *temp = list;
    while(temp != NULL) {
        length ++;
        temp = temp -> next;
    }
    return length;
}

DataType getDataByPos(LinkList *list, int pos) {
    LinkList *iterator = list;
    for(int i = 0;i < pos && iterator != NULL;i ++) {
        iterator = iterator -> next;
    }
    if(iterator != NULL) {
        return iterator -> data;
    } else {
        return NULL;
    }
}

DataType* getData(LinkList* list) {
    int length = getLength(list);
    DataType data[length];
    LinkList  *temp = list;
    int iterator = 0;
    while(temp != NULL) {
        data[iterator ++] = temp -> data;
        temp = temp -> next;
    }
    return data;
}

/*
 * 向链表中插入元素
 * 注: pos从0开始
 */
int insertData(LinkList* list, int pos, DataType data) {
    LinkList *iterator = list, *temp = (LinkList*) malloc(sizeof(LinkList));
    int insertFlag = 1;
    for(int i = 0;i < pos && iterator != NULL;i ++) {
        iterator = iterator -> next;
    }
    if(iterator != NULL) {
        temp->data = data;
        temp->next = iterator->next;
        iterator->next = temp;
    } else {
        insertFlag = 0;
    }
    
    return insertFlag;
}

/*
 * 删除链表中元素
 * 注: pos从0开始
 */
int deleteData(LinkList* list, int pos) {
    LinkList *iterator = list;
    LinkList *pre_iterator;
    int deleteFlag = 0;
    for(int i = 0;i < pos && iterator != NULL;i ++) {
        pre_iterator = iterator;
        iterator = iterator -> next;
    }
    if(iterator != NULL) {
        deleteFlag = 1;
        pre_iterator -> next = iterator -> next;
        free(iterator);
    } else {
        deleteFlag = -1;
    }
    
    return deleteFlag;
}
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