基础数据结构
Lil box
Dreaming
展开
-
C语言实现并查集
#include <stdio.h> #include <stdlib.h> #define swap(a, b) { \ __typeof(a) __temp =a;\ a = b; b = __temp;\ } typedef struct UnionSet{ int *father,*size; int n; }UnionSet; UnionSet *init(int n){ UnionSet *u = (UnionSet *) malloc(sizeof(Un原创 2020-12-13 20:00:40 · 273 阅读 · 0 评论 -
插入 、冒泡 、 归并排序
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> #define swap(a, b) {\ __typeof(a) __temp = a;\ a = b; b = __temp;\ } #define TEST(arr, n, func, args...) {\ int *num = (int *)malloc(sizeof(i原创 2020-11-02 00:06:39 · 99 阅读 · 0 评论 -
C语言实现栈
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Stack { int *data; int size, top; } Stack; Stack *init(int); void clear(Stack *); int top(Stack *); int empty(Stack *); int push(Stack *,int); int pop(Stack *); void原创 2020-12-12 14:21:29 · 104 阅读 · 0 评论 -
C语言-队列
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Queue { int *data; int head, tail, length, cnt; } Queue; Queue *init(int n) { Queue *q = (Queue *)malloc(sizeof(Queue)); q->data = (int *)malloc(sizeof(int));原创 2020-12-11 23:00:31 · 138 阅读 · 1 评论 -
C语言实现链表
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct ListNode { int data; struct ListNode *next; } ListNode; typedef struct List { ListNode head; int length; } List; ListNode *getNewNode(int); List *getLinkList(); v原创 2020-12-11 16:34:44 · 194 阅读 · 0 评论 -
c语言实现顺序表
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Vector { int *data; int size; //总大小 int length; //现大小 } Vector; Vector *init(int n) { Vector *vec = (Vector *)malloc(sizeof(Vector)); vec->data = (int *)mall原创 2020-11-30 22:07:15 · 111 阅读 · 0 评论