数据结构
Uwen_MYself
这个作者很懒,什么都没留下…
展开
-
02-线性结构2 Reversing Linked List
02-线性结构2 Reversing Linked List原创 2016-05-31 15:38:21 · 684 阅读 · 0 评论 -
07-图4 哈利·波特的考试
哈利·波特要考试了,他需要你的帮助。这门课学的是用魔咒将一种动物变成另一种动物的本事。例如将猫变成老鼠的魔咒是haha,将老鼠变成鱼的魔咒是hehe等等。反方向变化的魔咒就是简单地将原来的魔咒倒过来念,例如ahah可以将老鼠变成猫。另外,如果想把猫变成鱼,可以通过念一个直接魔咒lalala,也可以将猫变老鼠、老鼠变鱼的魔咒连起来念:hahahehe。 现在哈利·波特的手里有一本教材,里面列出了所有原创 2016-06-02 21:04:55 · 572 阅读 · 0 评论 -
06-图3 六度空间
给定一个有NN个顶点和EE条边的无向图,请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N-1N−1编号。进行搜索时,假设我们总是从编号最小的顶点出发,按编号递增的顺序访问邻接点。 输入格式:输入第1行给出2个整数NN(0#include <iostream>#include <queue>#include <vector>using namespace std;int vectexn原创 2016-06-02 20:01:41 · 428 阅读 · 0 评论 -
06-图2 Saving James Bond - Easy Version
This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the world’s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land a原创 2016-06-02 20:20:02 · 443 阅读 · 0 评论 -
05-树9 Huffman Codes
In 1953, David A. Huffman published his paper “A Method for the Construction of Minimum-Redundancy Codes”, and hence printed his name in the history of computer science. As a professor who gives the fi原创 2016-06-02 17:37:01 · 371 阅读 · 0 评论 -
05-树8 File Transfer
We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer o原创 2016-06-02 17:19:51 · 351 阅读 · 0 评论 -
05-树7 堆中的路径
将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i,打印从H[i]到根结点的路径。 输入格式:每组测试第1行包含2个正整数NN和MM(\le 1000≤1000),分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的NN个要被插入一个初始为空的小顶堆的整数。最后一行给出MM个下标。 输出格式:对输入中给出的每个下标i,在一行中输出从H原创 2016-06-02 16:28:03 · 346 阅读 · 0 评论 -
04-树6 Complete Binary Search Tree
A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: The left subtree of a node contains only nodes with keys less than the node’s key. The right sub原创 2016-06-02 15:56:53 · 242 阅读 · 0 评论 -
04-树4 是否同一棵二叉搜索树
04-树5 Root of AVL Tree (25分) An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ b原创 2016-06-02 15:19:44 · 440 阅读 · 0 评论 -
03-树3 Tree Traversals Again
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack原创 2016-06-02 11:12:04 · 336 阅读 · 0 评论 -
03-树2 List Leaves
Given a tree, you are supposed to list all the leaves in the order of top down, and left to right. Input Specification:Each input file contains one test case. For each case, the first line gives a pos原创 2016-06-02 10:54:20 · 356 阅读 · 0 评论 -
03-树1 树的同构
03-树1 树的同构原创 2016-05-31 17:05:09 · 401 阅读 · 0 评论 -
02-线性结构3 Pop Sequence
02-线性结构3 Pop Sequence原创 2016-05-31 16:31:54 · 529 阅读 · 0 评论 -
08-图9 关键活动
假定一个工程项目由一组子任务构成,子任务之间有的可以并行执行,有的必须在完成了其它一些子任务后才能执行。“任务调度”包括一组子任务、以及每个子任务可以执行所依赖的子任务集。 比如完成一个专业的所有课程学习和毕业设计可以看成一个本科生要完成的一项工程,各门课程可以看成是子任务。有些课程可以同时开设,比如英语和C程序设计,它们没有必须先修哪门的约束;有些课程则不可以同时开设,因为它们有先后的依赖关系,原创 2016-07-25 21:57:06 · 845 阅读 · 0 评论