qq_46635165的博客

串#include<stdio.h>#include<stdlib.h>#define MAX 250typedef struct{ char data[MAX]; int length;} defstring;//获取字符串长度int getlen(char str[]){ int i=0; while(str[i]) i ++; return i;} //初始化 int init_str(defstring *S,char str[]){

队列#include<stdio.h>#include<stdlib.h>#include<time.h>#define max_size 10//集合typedef struct table{ int *a; int length;} table;//初始化 void initTable(table *U){ U->a = (int *)malloc(sizeof(int) * max_size); U->length = 0;

判断回文（队列和栈综合运用）#include<stdio.h>#include<stdlib.h>#define MAX 250//定义栈数据类型typedef struct stack{ int *a; int top;} stack;//定义队列typedef struct opt{ int *b; int length;} opt;//获取字符串长度int getlen(char data[]){ int i=0; while(data[

数组-二维数组生成#include<stdio.h>#include<stdlib.h>#include<time.h>#define max 250//动态分配数组空间 int **getarry(int row,int col){ int **arr; arr = (int **)malloc(row * sizeof(int *)); for(int i=0;i<row;i++) arr[i] = (int *)malloc(col *

顺序栈#include<stdio.h>#include<stdlib.h>#define max_size 10//抽象数据类型 typedef struct stack{ int *a; int top;} stack;//判空 int Empty(stack *L){ return (L->top == -1);} //判满 int Full(stack *L){ return (L->top == max_size);}/

链表双链表#include<stdio.h>#include<stdlib.h>//定义数据类型 typedef struct Dlink{ int elem; struct Dlink *ahead; struct Dlink *next;} dlink;//生成双链表函数dlink *initDlink(){ dlink *p = (dlink*)malloc(sizeof(dlink)); dlink *temp = p; p->ahead