- 博客(7)
- 资源 (2)
- 收藏
- 关注
原创 HDOJ 1242 Rescue(BFS+优先对列)
http://acm.hdu.edu.cn/showproblem.php?pid=1242 Rescue Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18735 Accepted Submission(s): 6
2015-03-24 20:56:51 589
原创 NYOJ 题目63 小猴子下落(满二叉树的建立与遍历)
http://acm.nyist.net/JudgeOnline/problem.php?pid=63 小猴子下落 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述 有一颗二叉树,最大深度为D,且所有叶子的深度都相同。所有结点从左到右从上到下的编号为1,2,3,·····,2的D次方减1。在结点1处放一个小猴子,它会往下跑。每个内结点上都有一
2015-03-19 20:14:22 817
原创 HDOJ 3791 二叉搜索树(二叉排序树的建立和遍历)
http://acm.hdu.edu.cn/showproblem.php?pid=3791 二叉搜索树 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3068 Accepted Submission(s): 134
2015-03-19 11:25:37 1395
原创 HDOJ 3999 The order of a Tree(二叉排序树)
http://acm.hdu.edu.cn/showproblem.php?pid=3999 The order of a Tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1265 Accepted Subm
2015-03-18 18:01:19 719
原创 Poj 3984 迷宫问题(BFS)
http://poj.org/problem?id=3984 迷宫问题 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9248 Accepted: 5482 Description 定义一个二维数组: int maze[5][5] = {
2015-03-18 11:51:31 577
原创 hdoj 1710 Binary Tree Traversals(二叉树的建立及遍历)
http://acm.hdu.edu.cn/showproblem.php?pid=1710 Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3896 Accepted S
2015-03-17 20:30:53 1139
原创 HDOJ Safe Or Unsafe(最优二叉树或哈弗曼树)
http://acm.hdu.edu.cn/showproblem.php?pid=2527 Safe Or Unsafe Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1606 Accepted Submissio
2015-03-14 11:18:41 753
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人