码迷,mamicode.com
首页 >  
搜索关键字:trees    ( 1351个结果
linux命令之-pstree使用说明
pstree shows running processes as a tree. The tree is rooted at either pid or init if pid is omitted. If a user name is specified, all process trees r...
分类:系统相关   时间:2014-06-11 07:46:47    阅读次数:522
UVA Tree
题目如下: Tree  You are to determine the value of the leaf node in a given binary treethat is the terminal node of a path of least value from the root of thebinary tree to any le...
分类:其他好文   时间:2014-06-05 05:27:11    阅读次数:268
UVA Quadtrees
题目如下; Quadtrees  A quadtree is a representation format used to encode images. The fundamental ideabehind the quadtree is that any image can be split into four quadrants. Each...
分类:其他好文   时间:2014-06-05 04:20:06    阅读次数:226
hdu 1392 Surround the Trees (凸包)
Surround the TreesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7043Accepted Submission(s): 2688...
分类:其他好文   时间:2014-06-03 16:27:36    阅读次数:339
UVA 712(二叉树模拟)
L - S-Trees Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Appoint description:  System Crawler  (2014-04-01) Description   S-Tree...
分类:其他好文   时间:2014-06-03 00:53:43    阅读次数:335
Codeforces Round #247 (Div. 2)
A。水题。遍历字符串对所给的对应数字求和即可。B。简单题。对5个编号全排列,然后计算每种情况的高兴度,取最大值。C。dp。设dp[n][is]表示对于k-trees边和等于n时,如果is==1表示存在边至少为d的边,如果is==0表示不存在边至少为d的边。初始状态dp[0][0]=1。//和为n且不...
分类:其他好文   时间:2014-06-02 21:24:54    阅读次数:275
红黑树
介绍还有一种平衡二叉树:红黑树(Red Black Tree),红黑树由Rudolf Bayer于1972年发明,当时被称为平衡二叉B树(symmetric binary B-trees),1978年被Leonidas J. Guibas和Robert Sedgewick改成一个比較摩登的名字:红黑...
分类:其他好文   时间:2014-06-02 20:05:23    阅读次数:375
LeetCode: Same Tree [100]
【题目】 Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 【题意】 判断了两个二叉树是否相等 【思路】 递归...
分类:其他好文   时间:2014-06-02 11:03:03    阅读次数:205
LeetCode: Unique Binary Search Trees [095]
【题目】 Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ / / / \ 3 2 1 ...
分类:其他好文   时间:2014-06-01 15:34:24    阅读次数:231
LeetCode: Unique Binary Search Trees II [096]
【题目】 Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should return all 5 unique BST's shown below. 1 3 3 2 1 \ / / / \ ...
分类:其他好文   时间:2014-06-01 15:33:45    阅读次数:297
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!