[Data structures]EvaluateExpression
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 typedef int ElemType; typedef struct _SqStack{ ElemType *base; ElemType *top; int stackSize; }SqStack; int InitStack(SqStack *S) { S->base = (ElemType *)malloc(MAX*sizeof(ElemType...标签: Data Structures data_structures
[Data structures]Maze
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_STACK 1024 #define MAX 11 typedef struct _PosType{ int x,y; }PosType; typedef struct _SElemType{ int ord; PosType seat; int di; }SElemType; typedef struct _MazeType{ int matrix[MAX][...标签: Data Structures data_structures
[Data structures]Stack
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 typedef struct _SqStack{ int *base; int *top; int stackSize; }SqStack; int InitStack(SqStack *S) { S->base = (int *)malloc(MAX*sizeof(int)); S->top = S->base; S->stackSi...标签: Data Structures data_structures
[Data structures]Create index lists (An example of string)
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX_KEY_NUM 255 #define MAX 255 typedef unsigned char SString[MAX+1]; typedef struct _WordList{ char *item[MAX_KEY_NUM]; int last; }WordList; typedef struct _LinkList{ int book_number; struct _...标签: Data Structures data_structures
[Data structures]String
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 255 typedef unsigned char SString[MAX+1]; int next[MAX]; /* * 0 :j == 1 * k :T[1...k-1] == T[j-(k-1)...j-1] * 1 :Others * */ void get_next(SString T, int next[]) { int i,j; i = 1; nex...标签: Data Structures data_structures
[Data structures]General list
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 /* General list */ typedef struct _GLNode{ int tag; //0-atom, 1-node union{ char atom; struct{ struct _GLNode *hp; struct _GLNode *tp; }ptr; }; }GList; int server(...标签: Data Structures data_structures
[Data structures]Orthogonal link
#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _OLNode{ int i,j; int e; struct _OLNode *right, *down; }OLNode; typedef struct _CrossList{ OLNode **rhead; OLNode **chead; int m,n,t; //m rows, n cols, t none zero }CrossList; int CreateMatr...标签: Data Structures data_structures
[Data structures]Triple sequential matrix
#include <stdio.h> #include <stdlib.h> #define MAX 1024 typedef struct _Triple{ int i,j; int e; }Triple; typedef struct _TSMatrix{ Triple data[MAX+1]; int rpos[MAX+1]; //Sequential table of row logical link int m,n,t; //m rows, n cols, t none zero }TSMatrix; void...标签: Data Structures data_structures
[Data structures]Create binary tree by sequence
#include <stdio.h> #include <stdlib.h> #define MAX 20 typedef struct _BiTree{ char data; struct _BiTree *left; struct _BiTree *right; }BiTree; void CreateByPreInOrder(BiTree **T, char *pre, int pre_begin, int pre_end, char *in, int in_begin, int in_end) { int len; i...标签: Data Structures data_structures
[Data structures]Backtrack
#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 20 #define INFINIT 65535 int k; void GetPowerSet(int i, int *A, int *B) { int x; int j; if(i>A[0]){ for(j=1; j<=B[0]; j++){ printf("%d", B[j]); } printf("\n"); }else{ x ...日历
最新微语
- 有的时候,会站在分叉路口,不知道向左还是右
2023-12-26 15:34
- 繁花乱开,鸟雀逐风。心自宁静,纷扰不闻。
2023-03-14 09:56
- 对于不可控的事,我们保持乐观,对于可控的事情,我们保持谨慎。
2023-02-09 11:03
- 小时候,
暑假意味着无忧无虑地玩很长一段时间,
节假意味着好吃好喝还有很多长期不见的小朋友来玩...
长大后,
这是女儿第一个暑假,
一个半月...
2022-07-11 08:54
- Watching the autumn leaves falling as you grow older together
2018-10-25 09:45
分类
最新评论
- Goonog
i get it now :) - 萧
@Fluzak:The web host... - Fluzak
Nice blog here! Also... - Albertarive
In my opinion you co... - ChesterHep
What does it plan? - ChesterHep
No, opposite. - mojoheadz
Everything is OK!... - Josephmaigh
I just want to say t... - ChesterHep
What good topic - AnthonyBub
Certainly, never it ...