weixin_41867334的博客

#include<stdio.h>#include<iostream.h>#define MAX 100#define N 100typedef struct{ char v[N];}A;typedef struct node //邻接表表结点{ int adjvex; //...

#include<stdio.h>#include<iostream.h>#define MAX 100#define N 100/**************************************************************************/typedef struct{ char v[N];}V;typedef struct /...

#include<stdio.h>#include<stdlib.h>void puts(int a[],int N){ printf("请分别输入要锯成的%d块木头的长度：\n",N); for(int i=0;i<N;i++) scanf("%d",&a[i]);}void paixu(int a[],int N){ int max...

#include <iostream.h> #define MAXSIZE 100 typedef char ElemType; typedef struct BiTNode{ ElemType data; struct BiTNode *lchild,*rchild; } BiTNode,*BiTree; void CreateBiTree1(BiTr...

#include<stdio.h>#include<stdlib.h>#define MAX 12typedef int datatype;typedef struct{ int i, j; //行号、列号 datatype v; //元素值} node;typedef struct{ int m, n, t; //行...

#include<iostream> using namespace std; struct st { char str[100]; int n; //存个数 }b[100]; //all words in this centence should be store in every characters, and the longest word...

#include<iostream.h>#define maxsize 100typedef struct queue{int data[maxsize];int head;int tail;}Queue;void init(Queue *l){ l->head=-1; l->tail=-1;}void empty(Queue l){ if(l.head==-1&a...

#include<stdio.h> #include<stdlib.h> #define maxsize 100 typedef struct SqStack{ int data[maxsize]; int top; }SqStack; void SqStackEmpty(SqStack *st)//判断栈是否为空{ st->to...

#include<iostream.h>#include<stdio.h>#include <stdlib.h>typedef int ElemType;typedef struct LNode{ ElemType data; struct LNode *next;}Lnode,*Linklist;void Create(Linklist &L,in...

#include<iostream.h>typedef int ElemType;typedef struct lnode{ ElemType data; struct lnode *next;}Lnode,*Linklist;void CreateList(Linklist &L,int n){ L=new Lnode; L->data=NU...

#include<iostream.h>#include<stdlib.h># define maxsize 50 typedef struct {int a[maxsize]; int size;}sqlist; void Initlist(sqlist &L,int n)//建立顺序表{ int i; cout<<"输入...