- 博客(14)
- 收藏
- 关注
RSS订阅原创 数据结构---循环双链表
////循环双链表(带头节点)//# include<iostream># include<math.h>using namespace std;typedef int Elemtype;typedef struct DNode{ Elemtype data; struct DNode *prior,*next;}Dnode,*DLinklist;int ary[10] = {0,1,2,3,4,5};bool InitDLinkList(
2021-08-20 16:57:42
41
原创 数据结构---双向链表
////双链表(带头节点)//# include<iostream># include<math.h>using namespace std;typedef int Elemtype;typedef struct DNode{ Elemtype data; struct DNode *prior,*next;}Dnode,*DLinklist;int ary[10] = {0,1,2,3,4,5};bool InitDLinkList(DL
2021-08-20 16:39:18
53
原创 数据结构---队列的链式存储
////队列的链式存储结构//# include<iostream># include<math.h>using namespace std;typedef int Elemtype;typedef struct LinkNode{ Elemtype data; struct LinkNode *next;}LinkNode;typedef struct { LinkNode *front,*rear;}LinkQueue;voi
2021-08-14 20:22:48
74
原创 数据结构---队列
# include<iostream># include<math.h>using namespace std;# define MaxSize 50typedef int Elemtype;typedef struct{ Elemtype data[MaxSize]; int front,rear;} Queue;int ans[7]={0,1,2,3,4,5,6};void InitQueue(Queue &Q){ Q.re
2021-08-08 20:06:59
46
原创 数据结构---查找
# include<iostream># include<math.h>using namespace std;typedef int Elemtype;typedef struct { Elemtype *elem; int TableLen;}SSTable,SeqList;int Search_Seq(SSTable &ST,Elemtype key){ for(int i=1;i<=ST.TableLen;i++){
2021-08-08 18:36:40
33
原创 数据结构---栈的基本操作
# include <iostream># include <math.h># define Maxsize 100typedef int Elemtype;typedef struct { Elemtype data[Maxsize]; int top;} Stack;typedef struct Linknode{ Elemtype data; struct Linknode *next;} *LiStack;void Init
2021-08-06 16:24:12
52
原创 数据结构---二叉排序树
//// 排序二叉树//# include<iostream># include<stdio.h># include<math.h>using namespace std;# define numm 9typedef int Elemtype;typedef struct BSTNode{ Elemtype data; BSTNode *lchild,*rchild;}BSTNode,*BiTree;int n = nu
2021-07-31 21:29:21
51
原创 数据结构---线索二叉树
//// 线索二叉树//# include<math.h># include<iostream># include<stdio.h>using namespace std;int num[30] = {1,2,4,0,0,5,0,0,3,6,0,0,7,0,0};int i = 0;typedef int Elemtype;typedef struct ThreadTNode{ //链式存储结构 Elemtype data
2021-07-28 21:40:58
43
原创 数据结构代码---二叉树的遍历
//// 二叉树的遍历//# include<math.h># include<iostream># include<stdio.h>using namespace std;int num[30] = {1,2,4,0,0,5,0,0,3,6,0,0,7,0,0};int i = 0;typedef int Elemtype;typedef struct BiTNode{ //链式存储结构 Elemtype data;
2021-07-23 20:04:16
104
原创 数据结构---单链表
//// 单链表//# include<iostream># include<stdio.h># include<math.h>using namespace std;typedef int Elemtype;typedef struct LNode{ Elemtype data = 0; struct LNode *next;}LNode, *LinkList;LinkList List_HeadInsert2(Link
2021-07-11 23:27:04
42
2
原创 数据结构代码----顺序表
//// 顺序表的操作//# include<istream># include<math.h># include<stdio.h>typedef int Elemtype ;#define InitMaxsize 50typedef struct{ Elemtype data[InitMaxsize]; int length; int Maxsize = InitMaxsize;}SqList; //静态顺序表ty
2021-07-07 18:56:15
53
原创 如何屏蔽windows的更新
win + R输入框内输入services.msc找到windos update右键打开属性，选择禁用之后选择恢复栏，在第一次失败选项中选择无操作点击应用之后打开策略编辑器在管理模板中找windows更新右侧找到配置自动更新右键编辑选择已禁用这样windows就不会再更新了...
2021-03-18 18:13:58
373
原创 解决windows打开策略编辑器失败
Windows家庭版屏蔽了策略编辑器但是想打开怎么办首先在桌面中创建一个记事本 命名为gpedit在里面写入@echo offpushd "%~dp0"dir /b C:\Windows\servicing\Packages\Microsoft-Windows-GroupPolicy-ClientExtensions-Package~3*.mum >List.txtdir /b C:\Windows\servicing\Packages\Microsoft-Windows-GroupPo
2021-03-18 18:12:38
231
原创 银行家算法----安全性检查C语言实现
# include<bits/stdc++.h>using namespace std;# define maxn 105int num_pr,num_re;struct Banker{ char name[10]; int max[maxn]; int allocation[maxn]; int need[maxn];}a[maxn];int resources[maxn];int available[maxn];int work[maxn];.
2020-12-15 11:05:24
1116
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人