随笔分类 -  数据结构

graph.h
摘要：View Code 图的邻接距阵与邻接表的转换#include <stdio.h>#include <malloc.h>#define INF 32767 //INF表示∞typedef int InfoType;typedef int Vertex;#define MAXV 50 //最大顶点个数//以下定义邻接矩阵类型typedef struct { int nunber; //顶点编号InfoType info; //顶点其他信息} VertexType; //顶点类型typedef struct //图的定义{ int edg... 阅读全文
posted @ 2012-05-25 11:06 C's 阅读(750) 评论(0) 推荐(0)
先序完全2xtree的判断（转）
摘要：#include<stdio.h>#include<stdlib.h>typedef struct bitree{char data;struct bitree *lchild,*rchild;}bitree;int main(){bitree* createbitree(int i,int *j,bitree *t,char *ch);void lordertraverse(bitree *t);int i,*j,a;char *ch;bitree *t;t=NULL;a=1;j=&a;ch=(char *)malloc(2*sizeof(char));i=1 阅读全文
posted @ 2012-05-18 10:27 C's 阅读(236) 评论(0) 推荐(0)
2xtree
摘要：#include<stdio.h>typedef int ElemType;typedef struct node //定义二叉树结点结构{ ElemType data; struct node *lchild; struct node *rchild;}BTNode;typedef struct //1.定义双亲结构储存类型{ ElemType data; int parent; //指向双亲的位置}ptree[MaxSize];typedef struct node ... 阅读全文
posted @ 2012-05-11 11:24 C's 阅读(236) 评论(0) 推荐(0)
zz
摘要：View Code #include<stdio.h>#include<stdlib.h>const int N=20;int q[N];int cont=0;void print(int n){ cont++; int i; printf("NO.%d:",cont); for(i=1;i<=n;i++) printf("%d",q[i]); printf("\n");}int find(int i,int k){ int j; j=1; while(j<k) { if((q[j]==i)||(a 阅读全文
posted @ 2012-04-27 11:21 C's 阅读(255) 评论(0) 推荐(0)
nQueen
摘要：View Code #include<stdio.h>#include<stdlib.h>const int N=20;int q[N];int cont=0;void print(int n){ cont++; int i; printf("NO.%d:",cont); for(i=1;i<=n;i++) printf("%d",q[i]); printf("\n");}int find(int i,int k){ int j; j=1; while(j<k) { if((q[j]==i)||(a 阅读全文
posted @ 2012-04-27 10:25 C's 阅读(204) 评论(0) 推荐(0)
美国
摘要：#include<stdio.h>#define max 100struct{int i,j;int pre;}qu[max];int front=-1,rear=-1;int mgpath(int xi,int yi,int xe,int ye)//[xe,ye]->[xi,yx]{int i,j,find=0,di;rear++;qu[rear].i=xi;qu[rear].j=yi;qu[rear].pre=-1;mg[1][1]=-1;while(front<=rear &&!find) 阅读全文
posted @ 2012-04-13 11:32 C's 阅读(191) 评论(0) 推荐(0)
杨辉三角
摘要：#include<stdio.h>int main(){ int c[200][200]={0},i,j,x,a=1,k; printf("please enter the line you need:"); scanf("%d",&x); for(i=0;i<x;i++) { for(j=0;j<=i;j++) { if(i==j||j==0)c[i][j]=1; else c[i][j]=c[i-1][j-1]+c[i-1][j]; } } for(i=0;i<x... 阅读全文
posted @ 2012-04-13 10:09 C's 阅读(192) 评论(0) 推荐(0)
后缀表达式
摘要：1.c#include<stdio.h>#define size 100struct{ char ch; int pri;}lpri[]={{'=',0},{'(',1},{'*',5},{'/',5},{'+',3},{'-',3},{')',6}},rpri[]={{'=',0},{'(',6},{'*',4},{'/',4},{'+',2},{'-',2},{') 阅读全文
posted @ 2012-03-30 11:06 C's 阅读(360) 评论(0) 推荐(0)
迷宫
摘要：exp3-5.cpp//文件名：exp3-5.cpp#include<stdio.h>#define M 4 //行数#define N 4 //列数#define MaxSize 100 //栈最多元素的个数int mg[M+2][N+2]={ {1,1,1,1,1,1},{1,0,0,0,1,1}, {1,0,1,0,0,1},{1,0,0,0,1,1}, {1,1,0,0,0,1},{1,1,1,1,1,1}};struct{ int i,j,di;}stack[MaxSize],path[MaxSize]; ... 阅读全文
posted @ 2012-03-30 09:48 C's 阅读(188) 评论(0) 推荐(0)
Stu-List
该文被密码保护。
posted @ 2012-03-27 15:50 C's 阅读(3) 评论(0) 推荐(0)
实验2.1
该文被密码保护。
posted @ 2012-03-09 16:23 C's 阅读(1) 评论(0) 推荐(0)
3-9->学生表(tescher's)
该文被密码保护。
posted @ 2012-03-09 11:06 C's 阅读(5) 评论(0) 推荐(0)
3-9->2
摘要：#include<stdio.h>#include<malloc.h>#define MaxSize 50typedef char ElemType;typedef struct{ElemType data[MaxSize];int length;}SqList;void InitList(SqList * &L) //初始化顺序表L{L=(SqList *)malloc(sizeof(SqList));L->length=0;}void DestroyList(SqList *&L) //释放顺序表L{free(L);}int ListEmpty 阅读全文
posted @ 2012-03-02 11:26 C's 阅读(217) 评论(0) 推荐(0)
3-9->1
摘要：#include<stdio.h>#include<malloc.h>#include"2.cpp"#define MaxSize 50typedef char ElemType;extern void InitList(SqList *&L);extern void DestroyList(SqList *&L);extern int ListEmpty(SqList *L);extern int ListLength(SqList *L);extern void DispList(SqList *L);extern int Get 阅读全文
posted @ 2012-03-02 11:26 C's 阅读(293) 评论(0) 推荐(0)