-
在线订单系统,有SQL数据库,欢迎下载!
在线订单系统,有SQL数据库,欢迎下载!-On-line order system, with SQL databases, welcome to download!
- 2022-04-17 17:54:13下载
- 积分:1
-
插入运算符算法,123456789=a,在等式左边的任意两个数字之间插入 +...
插入运算符算法,123456789=a,在等式左边的任意两个数字之间插入 + - *使得等式成立,列出满足条件的所有结果-Insert operator algorithm, 123456789 = a, the left side of the equation inserted between any two figures+-* Make the equation set up, listing all of the results meet the conditions
- 2023-05-20 01:30:04下载
- 积分:1
-
可以实现两个大整数(不限数位)相加减! 在C++中,加减法的两个数必须在系统规定内,本程序突破了这一界限!...
可以实现两个大整数(不限数位)相加减! 在C++中,加减法的两个数必须在系统规定内,本程序突破了这一界限!-can achieve two large integers (Open-digit) is modified! In C++, and subtract the number two must be within the system, the process broke the limits!
- 2022-03-25 05:48:53下载
- 积分:1
-
校友信息系统
我的项目处理证书的校友信息系统,可以 upadate 删除和插入新数据,有时要搜索特定目的
- 2022-02-15 19:46:15下载
- 积分:1
-
c++链式队列的实现
c++链式队列的实现头文件如下:
typedef int Item;
typedef struct node * PNode;
typedef struct node
{
Item data;
PNode next;
}Node;
typedef struct
{
PNode front;
PNode rear;
int size;
}Queue;
/*构造一个空队列*/
Queue *InitQueue();
/*销毁一个队列*/
void DestroyQueue(Queue *pqueue);
/*清空一个队列*/
void ClearQueue(Queue *pqueue);
/*判断队列是否为空*/
int IsEmpty(Queue *pqueue);
/*返回队列大小*/
int GetSize(Queue *pqueue);
/*返回队头元素*/
PNode GetFront(Queue *pqueue,Item *pitem);
/*返回队尾元素*/
PNode GetRear(Queue *pqueue,Item *pitem);
/*将新元素入队*/
PNode EnQueue(Queue *pqueue,Item item);
/*队头元素出队*/
PNode DeQueue(Queue *pqueue,Item *pitem);
/*遍历队列并对各数据项调用visit函数*/
void QueueTraverse(Queue *pqueue,void (*visit)());
- 2023-09-04 20:50:03下载
- 积分:1
-
MaxtoCode Standard
MaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoMaxtoCode StandardMaxtoCode StandardCode StandardMaxtoCode StandardvvvvvvMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode StandardMaxtoCode Standard
- 2022-03-15 08:28:59下载
- 积分:1
-
query数据库的例子
query数据库的例子-example database query
- 2022-09-03 18:30:03下载
- 积分:1
-
数据结构实习 迷宫求解
数据结构实习 迷宫求解-data structure internship Maze Solving
- 2022-12-13 03:15:03下载
- 积分:1
-
sequence by means (from top to bottom, each of which left from right) traverse b...
按层序方式(自上而下,每层自左而右)遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage
- 2022-06-13 13:20:09下载
- 积分:1
-
银行定储模拟程序
银行定储模拟程序-Reserve Bank is scheduled simulation program
- 2022-03-19 22:05:44下载
- 积分:1