线性表:
- 顺序表(Vector)
- 链表(LinkList)
时间复杂度比较:
- 顺序表:
- 适合随机访问 O(1)。
- 插入、删除节点 O(N)。
- 链表:
- 不适合随机访问 O(N)。
- 插入、删除节点 O(1)。
链表:
- 单向链表
- 双向链表
- 循环链表
循环链表:
- 插入删除过程要注意,初始指针应指向链表尾节点(若当插入到头前时,找不到前驱节点)
- 当在更新尾节点时需要更新头指针
- 链表排序使用冒泡排序最为适合
数据结构 = 结构定义 + 结构操作
演示代码:
线性表
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#define malloc2 my_malloc(size, __FILE__, __func__, __LINE__)
void* my_malloc(int size, const char* file, const char* func, int line) {
void *data = malloc(size);
if (data == NULL) {
fprintf(stderr,"[%s : %s : %s] malloc error\n", file, func, line);
fflush(stderr);
abort();
}
return data;
}
typedef struct Vector {
int *data;
int size, length;
}Vector;
Vector* init(int n) {
Vector *p = (Vector*)malloc(sizeof(Vector));
p->data = (int*)malloc(sizeof(int) * n);
p->size = n;
p->length = 0;
return p;
}
int expand(Vector* v){
int new_size = v->size;
while (new_size){
int *data = (int *)realloc(v->data, sizeof(int) * (v->size + new_size));
if (data == NULL) {
new_size /= 2;
continue;
}
break;
}
printf("%d\n");
return 1;
}
int insert(Vector* v, int x, int ind) {
if (v->length >= v->size) {
if (!expand(v)) {
return 0;
}
return 0;
}
if (ind < 0 || ind > v->length) {
return 0;
}
for (int i = v->length - 1; i >= ind ; --i) {
v->data[i + 1] = v->data[i];
}
v->data[ind] = x;
v->length += 1;
return 1;
}
int delete_element(Vector *v, int ind){
if (ind >= v->length || ind < 0) {
return 0;
}
for (int i = ind + 1; i < v->length; ++i) {
v->data[i - 1] = v->data[i];
}
v->length -= 1;
return 1;
}
void output(Vector* v) {
printf("[ ");
for (int i = 0; i < v->length; ++i) {
printf(" %d", v->data[i]);
}
printf(" ]");
printf("\n");
}
void clear(Vector* v) {
if (v == NULL) return;
free(v->data);
free(v);
return;
}
int main() {
srand(time(0));
Vector *v = NULL;
v = init(100);
for (int i = 0; i < 10; ++i) {
int x = rand() % 100, ind = rand() % (i + 1);
printf("insert(%d, %d)", x, ind);
insert(v, x, ind);
output(v);
}
printf("\n");
for (int i = 0; i < 10; ++i) {
int ind = rand() % (v->length + 2) - 1;
printf("delete_element(%d) = ", ind);
int ret = delete_element(v, ind);
printf("%d : ", ret);
output(v);
}
return 0;
}
链表
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
typedef struct LinkNode {
int data;
struct LinkNode *next;
} LinkNode;
typedef struct LinkList {
LinkNode *head;
int n;
} LinkList;
LinkList* init() {
LinkList *p = (LinkList*)malloc(sizeof(LinkList));
p->head = NULL;
p->n = 0;
return p;
}
LinkNode* getNewNode(int data) {
LinkNode* p = (LinkNode*)malloc(sizeof(LinkNode));
p->data = data;
p->next = NULL;
return p;
}
void clear(LinkList* l) {
LinkNode* head = l->head;
while (head) {
LinkNode *next = head->next;
free(head);
head = next;
}
free(l);
return;
}
int insert(LinkList* l, int data, int ind) {
if (ind < 0) return 0;
LinkNode ret, *p;
ret.next = l->head;
p = &ret;
while (p && ind--) {
p = p->next;
}
if (p == NULL) return 0;
LinkNode* new_node = getNewNode(data);
new_node->next = p->next;
p->next = new_node;
l->head = ret.next;
l->n += 1;
return 1;
}
void output(LinkList* l) {
LinkNode* head = l->head;
while (head) {
printf("%d ->", head->data);
head = head->next;
}
printf("null\n");
}
int main(){
LinkList* l = init();
srand(time(0));
for (int i = 0; i < 10; ++i) {
int data = rand() % 100, ind = rand() % (i + 1);
printf("%d : insert(%d, %d) = ", i, data, ind);
fflush(stdout);
insert(l, data, ind);
output(l);
}
clear(l);
return 0;
}