- 博客(3)
- 收藏
- 关注
原创 uva 439 Knight Moves
Knight Moves A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares o
2015-12-15 18:44:37 266
原创 uva 563 Tree Recovery
输入一颗二叉树的先序遍历和中序遍历,输出后序遍历序列; 样例输入输出: DBACEGF ABCDEFG —> ACBFGED BCAD CBAD —> CDAB// 先序 = root + 左子序 + 右子序 中序 = 左子序 + root + 右子序 后序 = 左子序 + 右 子序 + root#include "iostream" #include "string"
2015-12-07 21:14:39 254
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人