qq_52391450的博客

#include <stdio.h>#include <stdlib.h>#define maxsize 3#define addsize 2typedef int elemType;typedef struct{ elemType *List;//首地址 int length;//长度 int listSize;//分配的内存大小} sqList;//初始化顺序链表void initList(sqList *L){ L-

#define MaxSize 100#include<stdio.h>typedef int DataType;typedef struct { DataType list[MaxSize]; int size;}SeqList;void ListInitiate(SeqList* L)//初始化顺序表L{ L->size = 0;} //定义初始元素个数int ListLength(SeqList L) {//返回顺序表L的当前元素个数 return L.siz

#include <stdio.h>#include <malloc.h>typedef char ElemType;typedef struct DataNode{ ElemType data; struct DataNode *next;} DataNode; //链队数据节点类型定义typedef struct{ DataNode *front; DataNode *rear;} LinkQuNode; //链队类型定义void Init

算法刷题

四大经典排序算法一、基数排序二、桶排序三、计数排序四、堆排序一、基数排序#ifndef sort__h#define sort__h#include <cstdio>#include <algorithm>#include <vector>#include <iostream>using namespace std;void print_array(int *arr, int n);// 打印数组int* sort_array(

#include<stdio.h>#include<stdlib.h>typedef char DataType; //声明数据类型struct BiTreeNode{ DataType data; BiTreeNode *leftChild; BiTreeNode *rightChild;};//初始化二叉树void initiateBiTree(BiTreeNode **root){ (*root) = (BiTreeNod

#include"stdio.h"#include"stdlib.h"typedef char DataType;typedef struct Node { DataType data; struct Node *leftChild; struct Node *rightChild;}BiTreeNode;void PrintData(DataType x){ printf("%c",x);}/*按先序序列建立一棵二叉树*/void CreatBiTree(BiTre

#include <iostream>#include <cstring>using namespace std;int k=0;int m=0; typedef struct BiTNode{ char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; void CreateBiTree(BiTree &T){ char ch; cin>>ch; if(ch=='0')T

#include"stdio.h"#include"stdlib.h"typedef char DataType;typedef struct Node { DataType data; struct Node *leftChild; struct Node *rightChild;}BiTreeNode;void PrintData(DataType x){ printf("%c",x);}/*按先序序列建立一棵二叉树*/void CreatBiTree(BiTre

#include <stdio.h>#include <stdlib.h>#include <stdbool.h>typedef struct BiTNode{ char data; struct BiTNode *Lchild, *Rchild;}BiTNode,*BiTree;// 6_41bool Find_K(BiTree B1,int* i, int k){ if(B1 == NULL) return false;

#include"stdio.h"#include"stdlib.h"typedef char DataType;typedef struct Node { DataType data; struct Node *leftChild; struct Node *rightChild;}BiTreeNode;void PrintData(DataType x){ printf("%c",x);}/*按先序序列建立一棵二叉树*/void CreatBiTree(BiTre

#include<cstdio>#include<algorithm>#include<queue> using namespace std; const int maxn = 1010; int vNum;vector<int> G[maxn];int inDegree[maxn] = {0};//记录每个点的入度 int inqNum = 0; bool topoSort(){ queue<int> Q; for(

# define INFINITY 1000# define MAX_VERTEX_NUM 20 //最大值# define OK 1#define MAX_VERTEX_NUM 20// 定义常量MAX_VERTEX_NUM为20#include<stdio.h>#include<stdlib.h> #include <iostream>#define MaxQueueSizea 100;typedef enum{DG,DN,UDG,UDN} Graph

创建无向图代码更改int CreatUDN(MGraph &G){ int IncInfo,i,j,k,v1,v2,w; printf("Please input the number of G.vexnum (eg,G.vexnum=4):"); scanf("%d",&G.vexnum);//输入顶点数 G.vexnum printf("Please input the number of G.arcnum (eg,G.arcnum=4): "); scanf("%d",.

图的结构定义# define INFINITY 1000# define MAX_VERTEX_NUM 20 //最大值# define OK 1#define MAX_VERTEX_NUM 20// 定义常量MAX_VERTEX_NUM为20#include<stdio.h>#include<stdlib.h> #include <iostream>#define MaxQueueSizea 100;typedef enum{DG,DN,UDG,U.

头文件信息# define MAX_VERTEX_NUM 20 //最大值# define OK 1#define MAX_VERTEX_NUM 20// 定义常量MAX_VERTEX_NUM为20#include<stdio.h>#include<stdlib.h> #include <iostream>#define MaxQueueSizea 100;typedef enum { DG, DN, UDG, UDN } GraphKind;// {.