Xiaoweidumpb

#include"SeqStack.h" void print(SeqStack *s){ for (int i = 0; i < s->top; i++) { printf("%4c",s->base[i]); } printf("\n"); } void main(){ SeqStack st; IniStack(&st); char ch=getchar(); while(ch!=

#include<stdio.h> #include<malloc.h> #include<assert.h> #include"Stack.h" #define ElemType char typedef struct BinTreeNode { ElemType data; struct BinTreeNode *leftChild; struct BinTreeNode *rightChild; }BinTreeNode; typedef struct

参加运动会的有n个学院，学校编号为1……n，比赛分成m个男子项目，和w个女子项目。项目编号为男子1……m，女子m+1……m+w。不同的项目取前八名积分，且前八名的积分分别为：9、7、6、5、4、3、2、1（m<=20，n<=20）。 功能要求：（1）可以输入各个项目的前八名的成绩；（2）能统计各学院的总分并排序；（3）可以按学院编号、学院总分、男女团体总分排序输出；（4）可以按学院编号查询学院某个项目的情况；可以按项目编号查询取得前八名的学院。（5）可以查找汇总某名选手参加的项目和获取的名次和积

int StrIndex(SString S, SString T, int pos) { int i = pos; int j = 0; while(S[i]!='\0' && T[j]!='\0') { if(S[i] == T[j]) { i++; j++; } else { i = i-j+1; j = 0; } } if(T[j] == '\0') return i-j; return -1; } void Str

#pragma once #include<stdio.h> #include<malloc.h> #include<assert.h> #define ElemType char typedef struct TreeNode { ElemType data; struct TreeNode *firstChild; //����㿴�� ��Ϊ���ӣ���Ϊ�ֵ� struct TreeNode *nextSibling; }Tr

#pragma once //防止重复编译 #include <stdio.h> #include <stdlib.h> #include <assert.h> #include <string.h> #define AtomType int typedef enum { HEAD, ATOM, CHILDLIST } ElemTag; typedef struct GLNode { ElemTag tag; //标记

头文件 #ifndef __SLIST_H__ #define __SLIST_H__ #include<stdio.h> #include<malloc.h> #include<assert.h> #define ElemType int typedef struct Node { ElemType data ; struct Node *next; }Node,*PNode; typedef struct List{ PNode

初始化定义 vscode虽然报错 但编译运行没有问题. 调用函数 函数实现

head #ifndef __LINKSTACK_H__ #define __LINKSTACK_H__ #include<stdio.h> #include<stdlib.h> #include<assert.h> #define ElemType int typedef struct StackNode{ ElemType data; struct StackNode *next; }StackNode; typedef StackNo

main #include"BinTree.h" //ABC##DE##F##G#H## void main() { char *VLR = "ABCDEFGH"; char *LVR = "CBEDFAGH"; char *LRV = "CEFDBHGA"; int n = strlen(VLR); BinTree mytree; InitBinTree(&mytree,'#'); CreateBinTree_5(&mytree,VLR,LVR,n); B

头文件 #ifndef __SEQSTACK_H__ #define __SEQSTACK_H__ #include<stdio.h> #include<malloc.h> #include<assert.h> #define ElemType int #define STACK_INIT_SIZE 8 #define STACK_INC_SIZE 3 typedef struct SeqStack { ElemType *base; int c

#include"SString.h" void main(){ SString S; InitString(S); SString T; InitString(T); StrAssign(S,"abcdefghi"); StrAssign(T,"xyz"); StrInsert(S,1,T); // int res=StrCompare(S,T); // printf("%d",res); // SStrin

头文件 #ifndef __STATICLIST_H__ #define __STATICLIST_H__ #include<stdio.h> #define MAX_SIZE 20 #define ElemType char typedef struct ListNode { ElemType data; int cur; }ListNode; typedef ListNode StaticList[MAX_SIZE]; int Malloc_SL(StaticList

#ifndef __HSTRING_H__ #define __HSTRING_H__ #include<stdio.h> #include<malloc.h> #include<assert.h> #include<string.h> typedef struct HString { char *ch; int length; }HString; void InitString(HString *S); void PrintString(HSt

头文件 //避免重复编译 #ifndef __SEQLIST_H__ #define __SEQLIST_H__ #include<stdio.h> #include<malloc.h> #include<assert.h> #define SEQLIST_INIT_SIZE 8 #define INC_SIZE 3 typedef int ElmeType; typedef struct SeqList { ElmeType *base; int cap

//////////////////////////////////////////////////////////////// //5 void CreateBinTree_5(BinTree *bt, char *VLR, char *LVR, int n) { CreateBinTree_5(bt->root,VLR,LVR,n); } void CreateBinTree_5(BinTreeNode *&t, char *VLR, char *LVR, int n) { if(n

#include"SeqQueue.h" void IniQueue(Queue *Q){ Q->base=(ElemType *)malloc(sizeof(ElemType) * MAXSIZE); assert(Q->base!=NULL); Q->front=Q->rear=0; } void EnQueue(Queue *Q,ElemType x){ if(((Q->rear+1)%MAXSIZE)==Q->front

#ifndef _SPARSEMATRIX_H #define _SPARSEMATRIX_H #include<stdio.h> #include<memory.h> #include<stdlib.h> #include<assert.h> #define ElemType int #define MAXSIZE 100 typedef struct Tripe { int i; int j; ElemType e; }Tripe

#include<stdio.h> #include<stdlib.h> #define MAXSIZE 100 typedef int elemtype; typedef struct //定义线性表的结构 { elemtype data[MAXSIZE]; int length; }SqList; /* 线性表初始化：Init_List(L) 初始条件：表L不存在 操作结果：构造一个空的线性表 */ SqList *Init_SeqList(){ SqList *L;

#include"SeqQueue.h" void main(){ Queue Q; IniQueue(&Q); ElemType v; for(int i=1;i<=5;++i){ EnQueue(&Q,i); } ShowQueue(&Q); DeQueue(&Q); ShowQueue(&Q); GetHead(&Q,&v); prin

头文件 #ifndef __SCLIST_H__ #define __SCLIST_H__ #include<stdio.h> #include<stdlib.h> #include<assert.h> #define ElemType int typedef struct Node { ElemType data; struct Node *next; }Node,*PNode; typedef struct List { PN

// LinkQueue.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include<stdio.h> #include<malloc.h> #include<assert.h> #define ElemType int typedef struct QueueNode{ ElemType data; struct Queue

#pragma once #include<stdio.h> #include<malloc.h> #include<assert.h> #define Default_Vertex_Size 10 #define T char typedef struct GraphMtx { int MaxVertices; //最大的定点数 int NumVertices; //顶点数 int NumEdges; //边数 T *V

#include <stdio.h> #include <stdlib.h> typedef int ElemType; typedef struct Node{ ElemType data; struct Node *next; }LinkNode,*LinkList; /* p: pointer q: next character of p,another pointer */ LinkList Creat_LinkList( ) //头插入法建立单链表算法 { Lin

#include"ThreadBinTree.h" void InitBinTree(BinTree *bt,ElemType ref){ bt->root=NULL; bt->refvalue=ref; } BinTreeNode* _Buynode(ElemType x){ BinTreeNode *s=(BinTreeNode*)malloc(sizeof(BinTreeNode)); assert(s!=NULL); s->data=x