BJFU_OJ系统数据结构习题目录

ゝ一世哀愁。 2023-06-17 02:04 35阅读 0赞

# 注意！北林oj的结果输出很严格。如果要输出1 2 3 4，注意1 2 3后面有空格，4后面无空格。因此最后一个数据要单独输出！空格也是字符，加上就和答案不同。有问题欢迎私信。 #

欢迎登录北京林业大学OJ系统  
[http://www.bjfuacm.com][http_www.bjfuacm.com]

[204基于顺序存储结构的图书信息表的创建和输出][204]  
[205基于顺序存储结构的图书信息表的排序][205]  
[206基于顺序存储结构的图书信息表的修改][206]  
[207基于顺序存储结构的图书信息表的逆序存储][207]  
[208基于顺序存储结构的图书信息表的最贵图书的查找][208]  
[209基于顺序存储结构的图书信息表的最爱图书的查找][209]  
[210基于顺序存储结构的图书信息表的最佳位置图书的查找][210]  
[211基于顺序存储结构的图书信息表的新图书的入库][211]  
[212基于顺序存储结构的图书信息表的旧图书的出库][212]  
[213基于顺序存储结构的图书信息表的图书去重][213]  
[214基于链式存储结构的图书信息表的创建和输出][214]  
[215基于链式存储结构的图书信息表的排序][215]  
[216基于链式存储结构的图书信息表的修改][216]  
[217基于链式存储结构的图书信息表的逆序存储][217]  
[218基于链式存储结构的图书信息表的最贵图书的查找][218]  
[219基于链式存储结构的图书信息表的最爱图书的查找][219]  
[220基于链式存储结构的图书信息表的最佳位置图书的查找][220]  
[221基于链式存储结构的图书信息表的新图书的入库][221]  
[222基于链式存储结构的图书信息表的旧图书的出库][222]  
[223基于链存储结构的图书信息表的图书去重][223]  
[224基于链表的两个一元多项式的基本运算][224]  
[225基于链表的两个递增有序序列的合并][225]  
[226基于链表的两个非递减有序序列的合并][226]  
[227基于链表的两个集合的交集][227]  
[228基于链表的两个集合的差集][228]  
[229链表的分解][229]  
[230查找链表中的最大值][230]  
[231链表的逆转][231]  
[232删除链表中满足区间值的结点][232]  
[233双向循环链表中结点的交换][233]  
[234删除顺序表中指定值的所有元素][234]  
[235查找链表中倒数第k个结点][235_k]  
[236删除链表中绝对值相等的结点][236]  
[237求解两个升序序列的中位数][237]  
[238查找两个单词链表共同后缀的起始结点][238]  
[239猴子选大王][239]  
[240基于栈的中缀算术表达式求值][240]  
[241双栈的基本操作][241]  
[242基于栈的回文字符序列判断][242]  
[243入栈和出栈的基本操作][243]  
[244基于栈的后缀算术表达式求值][244]  
[245基于栈的可操作判断][245]  
[246基于循环链表的队列的基本操作][246]  
[247附加判定标志的循环队列的基本操作][247]  
[248基于两端操作的循环队列的实现][248]  
[249Ackermann函数的递归求值][249Ackermann]  
[250Ackermann函数的非递归求值][250Ackermann]  
[251递归求解单链表中的最大值][251]  
[252递归求解单链表中的结点个数][252]  
[253递归求解单链表中的平均值][253]  
[254中缀表达式转化为后缀表达式][254]  
[255迷宫问题][255]  
[256病毒感染监测][256]  
[257统计字符出现的频度][257]  
[258递归实现字符串的逆序存储][258]  
[259字符串的插入][259]  
[260二维数组中的元素查重][260]  
[261数组的正负数分割排序][261]  
[262基于哈夫曼树的数据压缩算法][262]  
[263基于二叉链表的树结构相等的判断][263]  
[264基于二叉链表的二叉树左右孩子的交换][264]  
[265基于二叉链表的二叉树的双序遍历][265]  
[266基于二叉链表的二叉树最大宽度的计算][266]  
[267基于二叉链表的二叉树最长路径的求解][267]  
[268基于二叉链表的二叉树叶子结点到根结点的路径的求解][268]  
[269基于二叉链表的二叉树的遍历][269]  
[270基于二叉链表的二叉树结点个数的统计][270]  
[271基于二叉链表的二叉树高度的计算][271]  
[272基于二叉树的表达式求值][272]  
[273基于Dijsktra算法的最短路径求解][273_Dijsktra]  
[274六度空间理论][274]  
[275基于邻接表的新顶点的增加][275]  
[276基于邻接矩阵的新顶点的增加][276]  
[277基于邻接表的顶点的删除][277]  
[278基于邻接表的新边的增加][278]  
[279基于邻接矩阵的新边的增加][279]  
[280基于邻接表的边的删除][280]  
[281基于邻接矩阵的边的删除][281]  
[282基于邻接表的深度优先遍历][282]  
[283最长的最短路径的求解][283]  
[284基于深度优先搜索的两顶点路径存在与否的判断][284]  
[285基于邻接表的长度为k的简单路径的求解][285_k]  
[286基于邻接矩阵的顶点的删除][286]  
[287基于递归的折半查找][287]  
[288二叉排序树的判定][288]  
[289二叉排序树的限定条件下的数据输出][289]  
[290基于非递归的二叉排序树的结点的查找和插入][290]  
[291平衡二叉树的高度的计算][291]  
[292基于链地址法的散列表的插入][292]  
[293基于链地址法的散列表的删除][293]  
[294基于链表的简单选择排序][294]  
[295基于双向链表的双向冒泡排序法][295]  
[296砾石的交换排序][296]  
[297数组的正负排序][297]  
[298基于快排思想的查找][298]  
[299计数排序][299]

[http_www.bjfuacm.com]: http://www.bjfuacm.com
[204]: https://blog.csdn.net/weixin_43722827/article/details/102478697
[205]: https://blog.csdn.net/weixin_43722827/article/details/102479271
[206]: https://blog.csdn.net/weixin_43722827/article/details/102479410
[207]: https://blog.csdn.net/weixin_43722827/article/details/102479452
[208]: https://blog.csdn.net/weixin_43722827/article/details/102479721
[209]: https://blog.csdn.net/weixin_43722827/article/details/102479809
[210]: https://blog.csdn.net/weixin_43722827/article/details/102480208
[211]: https://blog.csdn.net/weixin_43722827/article/details/102480443
[212]: https://blog.csdn.net/weixin_43722827/article/details/102480641
[213]: https://blog.csdn.net/weixin_43722827/article/details/102480913
[214]: https://blog.csdn.net/weixin_43722827/article/details/102481014
[215]: https://blog.csdn.net/weixin_43722827/article/details/102481358
[216]: https://blog.csdn.net/weixin_43722827/article/details/102481945
[217]: https://blog.csdn.net/weixin_43722827/article/details/102482426
[218]: https://blog.csdn.net/weixin_43722827/article/details/102482571
[219]: https://blog.csdn.net/weixin_43722827/article/details/102482739
[220]: https://blog.csdn.net/weixin_43722827/article/details/102483020
[221]: https://blog.csdn.net/weixin_43722827/article/details/102483281
[222]: https://blog.csdn.net/weixin_43722827/article/details/102483524
[223]: https://blog.csdn.net/weixin_43722827/article/details/102483639
[224]: https://blog.csdn.net/weixin_43722827/article/details/102527983
[225]: https://blog.csdn.net/weixin_43722827/article/details/102518448
[226]: https://blog.csdn.net/weixin_43722827/article/details/102527019
[227]: https://blog.csdn.net/weixin_43722827/article/details/102527462
[228]: https://blog.csdn.net/weixin_43722827/article/details/102527476
[229]: https://blog.csdn.net/weixin_43722827/article/details/102527305
[230]: https://blog.csdn.net/weixin_43722827/article/details/102526903
[231]: https://blog.csdn.net/weixin_43722827/article/details/102527560
[232]: https://blog.csdn.net/weixin_43722827/article/details/102527602
[233]: https://blog.csdn.net/weixin_43722827/article/details/102527737
[234]: https://blog.csdn.net/weixin_43722827/article/details/102527759
[235_k]: https://blog.csdn.net/weixin_43722827/article/details/102526999
[236]: https://blog.csdn.net/weixin_43722827/article/details/102527792
[237]: https://blog.csdn.net/weixin_43722827/article/details/102527853
[238]: https://blog.csdn.net/weixin_43722827/article/details/102527882
[239]: https://blog.csdn.net/weixin_43722827/article/details/102526091
[240]: https://blog.csdn.net/weixin_43722827/article/details/102754606
[241]: https://blog.csdn.net/weixin_43722827/article/details/102754644
[242]: https://blog.csdn.net/weixin_43722827/article/details/102754776
[243]: https://blog.csdn.net/weixin_43722827/article/details/102755164
[244]: https://blog.csdn.net/weixin_43722827/article/details/102755224
[245]: https://blog.csdn.net/weixin_43722827/article/details/102755272
[246]: https://blog.csdn.net/weixin_43722827/article/details/102755285
[247]: https://blog.csdn.net/weixin_43722827/article/details/102755376
[248]: https://blog.csdn.net/weixin_43722827/article/details/102755404
[249Ackermann]: https://blog.csdn.net/weixin_43722827/article/details/102755409
[250Ackermann]: https://blog.csdn.net/weixin_43722827/article/details/102755443
[251]: https://blog.csdn.net/weixin_43722827/article/details/102755466
[252]: https://blog.csdn.net/weixin_43722827/article/details/102755486
[253]: https://blog.csdn.net/weixin_43722827/article/details/102755496
[254]: https://blog.csdn.net/weixin_43722827/article/details/102755529
[255]: https://blog.csdn.net/weixin_43722827/article/details/102755620
[256]: https://blog.csdn.net/weixin_43722827/article/details/102755675
[257]: https://blog.csdn.net/weixin_43722827/article/details/102755760
[258]: https://blog.csdn.net/weixin_43722827/article/details/102755802
[259]: https://blog.csdn.net/weixin_43722827/article/details/102755833
[260]: https://blog.csdn.net/weixin_43722827/article/details/102755872
[261]: https://blog.csdn.net/weixin_43722827/article/details/102755896
[262]: https://blog.csdn.net/weixin_43722827/article/details/110003928
[263]: https://blog.csdn.net/weixin_43722827/article/details/102839023
[264]: https://blog.csdn.net/weixin_43722827/article/details/102839108
[265]: https://blog.csdn.net/weixin_43722827/article/details/102839133
[266]: https://blog.csdn.net/weixin_43722827/article/details/102839242
[267]: https://blog.csdn.net/weixin_43722827/article/details/102839319
[268]: https://blog.csdn.net/weixin_43722827/article/details/102839401
[269]: https://blog.csdn.net/weixin_43722827/article/details/102839799
[270]: https://blog.csdn.net/weixin_43722827/article/details/102839901
[271]: https://blog.csdn.net/weixin_43722827/article/details/102839948
[272]: https://blog.csdn.net/weixin_43722827/article/details/110004008
[273_Dijsktra]: https://blog.csdn.net/weixin_43722827/article/details/110004162
[274]: https://blog.csdn.net/weixin_43722827/article/details/102877789
[275]: https://blog.csdn.net/weixin_43722827/article/details/102877800
[276]: https://blog.csdn.net/weixin_43722827/article/details/102877825
[277]: https://blog.csdn.net/weixin_43722827/article/details/102877841
[278]: https://blog.csdn.net/weixin_43722827/article/details/102877848
[279]: https://blog.csdn.net/weixin_43722827/article/details/102877863
[280]: https://blog.csdn.net/weixin_43722827/article/details/102877882
[281]: https://blog.csdn.net/weixin_43722827/article/details/102877900
[282]: https://blog.csdn.net/weixin_43722827/article/details/102877908
[283]: https://blog.csdn.net/weixin_43722827/article/details/102877918
[284]: https://blog.csdn.net/weixin_43722827/article/details/102877928
[285_k]: https://blog.csdn.net/weixin_43722827/article/details/102877937
[286]: https://blog.csdn.net/weixin_43722827/article/details/103258213
[287]: https://blog.csdn.net/weixin_43722827/article/details/102945312
[288]: https://blog.csdn.net/weixin_43722827/article/details/102964784
[289]: https://blog.csdn.net/weixin_43722827/article/details/102964796
[290]: https://blog.csdn.net/weixin_43722827/article/details/103258341
[291]: https://blog.csdn.net/weixin_43722827/article/details/103026526
[292]: https://blog.csdn.net/weixin_43722827/article/details/103258405
[293]: https://blog.csdn.net/weixin_43722827/article/details/103258445
[294]: https://blog.csdn.net/weixin_43722827/article/details/102945613
[295]: https://blog.csdn.net/weixin_43722827/article/details/103257814
[296]: https://blog.csdn.net/weixin_43722827/article/details/102933491
[297]: https://blog.csdn.net/weixin_43722827/article/details/103393146
[298]: https://blog.csdn.net/weixin_43722827/article/details/103393123
[299]: https://blog.csdn.net/weixin_43722827/article/details/103393613