Cherish599的博客

//离散事件模拟，模拟银行营业时的排队情况//不考虑顾客中途离开，顾客到达事件随机，业务办理时间//长度随机，选择最短的队排队，不再换队#include <stdio.h>#include <time.h>#include <stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int Status;typedef struct Event { //事件类

#include "stdio.h"#include "stdlib.h"#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -1typedef int QElemType;typedef int Status;typedef struct QNode{ QElemType data;//数据域 struct QNode* next;}QNode, * QueuePtr;//结点类型

#include "stdio.h"#include "stdlib.h"#define TRUE 1#define ERROR 0#define OK 1#define FALSE 0#define OVERFLOW -1typedef int QElemType;typedef int Status;#define MAXQSIZE 100typedef struct{ QElemType* base; int front; int rear;}SqQueue;//

问题描述源码如下：#include <stdio.h> // printf();scanf()#include <stdlib.h> // exit()#include <malloc.h> // malloc()#include <time.h> // srand((unsigned)time(NULL));// 函数结果状态代码#define TRUE 1#define FALSE 0#define OK 1

应用场景数制转换括号匹配的检查行编辑程序详情说明参考《数据结构（C语言版）》清华大学出版社严蔚敏编著 P48~P50代码如下：/* run this program using the console pauser or add your own getch, system("pause") or input loop */#include <stdio.h> // printf();scanf()#include <stdlib.h> // exit()

严蔚敏数据结构C语言实现栈的基本操作源码如下：#include<stdio.h>#include<stdlib.h>#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define OVERFLOW -1#define OK 1#define ERROR 0typedef int Status;typedef int SElemType;typedef struct { SElemType* bas

源码如下#include<stdio.h>#include<stdlib.h>#define LEN sizeof(Poly)typedef struct term { float coef; //系数 int expn; //指数 struct term* next;}Poly, * Link;void CreatePolyn(Link* p, int m);void PrintPolyn(Link p);int cmp(Link p1, Lin

#include <stdio.h>#include <stdlib.h>// 双向循环链表的节点结构typedef struct Node { int val; struct Node* prev; struct Node* next;} ListNode;// 显示菜单void DisplayMenu(){ printf("*************************\n"); printf("*[1]创建一个双向循

#include <stdio.h>#define MAXSIZE 1000#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int ElemType;typedef struct { ElemType data; int cur;}component, StaticLinkList[MAXSIZE];// 初始化一个静态链表void InitList(StaticLi

#include <stdio.h>#define maxSize 7typedef struct { char data; int cur;}component;//将结构体数组中所有分量链接到备用链表中void reserveArr(component* array);//初始化静态链表int initArr(component* array);//向链表中插入数据，body表示链表的头结点在数组中的位置，add表示插入元素的位置，a表示要插入的数据void inser

#include <stdio.h>#include <stdlib.h>#define ok 1#define error -1typedef int ElemType;typedef int Status;typedef struct Node{ ElemType data; struct Node* next;}LNode, * LinkList;//构造空表Status InitList(LinkList* L){ *L = (LinkLi

#include <stdio.h>#include <stdlib.h>#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -1#define LIST_INIT_SIZE 100#define LISTINCREMENT 10typedef int Status;typedef int ElemType;typedef struct{ ElemType*