苗火 Nicholas

[Data structures]Hanoi

2019-9-16 萧 写技术

#include <stdio.h> #include <stdlib.h> #include <string.h> #define MAX 1024 char stack[MAX][255]; int top = -1; void printStack() { int i; for(i=top; i>=0; i--){ printf("%s\n", stack[i]); } printf("\n"); } void hanoi(int n, char x, char y, char z) ...

阅读全文>>

标签: Data Structures data_structures

评论(0) 浏览(23)

[Data structures]EvaluateExpression

2019-9-12 萧 写技术

#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

评论(0) 浏览(34)

[Data structures]Maze

2019-8-30 萧 写技术

#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

评论(0) 浏览(42)

[Data structures]Stack

2019-8-30 萧 写技术

#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

评论(0) 浏览(34)

[Data structures]Create index lists (An example of string)

2019-8-30 萧 写技术

#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

评论(0) 浏览(30)

[Data structures]String

2019-8-23 萧 写技术

#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

评论(0) 浏览(37)

[Data structures]General list

2019-8-22 萧 写技术

#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

评论(0) 浏览(32)

[Data structures]Orthogonal link

2019-8-19 萧 写技术

#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

评论(0) 浏览(44)

[Data structures]Triple sequential matrix

2019-8-19 萧 写技术

#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

评论(0) 浏览(36)

[Data structures]Create binary tree by sequence

2019-8-8 萧 写技术

#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

评论(0) 浏览(53)