码迷,mamicode.com
首页 >  
搜索关键字:nodes    ( 4030个结果
Maximum Depth of Binary Tree
问题描述 Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 解决方案 /** * Definition fo...
分类:其他好文   时间:2014-09-02 00:26:44    阅读次数:217
LeetCode: Partition List
LeetCode: Partition ListGiven a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.Y...
分类:其他好文   时间:2014-09-02 00:05:33    阅读次数:235
Same Tree
问题描述 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-09-01 15:40:33    阅读次数:146
leetcode - Remove Duplicates from Sorted List II
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-...
分类:其他好文   时间:2014-09-01 12:15:43    阅读次数:169
LeetCode: Binary Tree Inorder Traversal
LeetCode: Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}...
分类:其他好文   时间:2014-08-31 22:38:11    阅读次数:215
[leecode]Binary Tree Preorder Traversal
Binary Tree Preorder TraversalGiven a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ...
分类:其他好文   时间:2014-08-31 18:34:41    阅读次数:180
[leetcode]Binary Tree InorderTraversal
Binary Tree Inorder TraversalGiven a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ ...
分类:其他好文   时间:2014-08-31 18:27:01    阅读次数:168
Merge Two Sorted Lists <LeetCode>
---恢复内容开始---Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lis...
分类:其他好文   时间:2014-08-31 17:01:51    阅读次数:270
LeetCode——Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is...
分类:其他好文   时间:2014-08-30 11:14:19    阅读次数:209
zabbix导航栏自定义Label、Zatree在新浏览器新标签页打开的方法
1.vim$zabbix_PATH/include/menu.inc.php284行增加以下内容284‘zatree‘=>array(285‘label‘=>_(‘Zatree‘),286‘user_type‘=>USER_TYPE_ZABBIX_USER,287‘default_page_id‘=>0,288‘force_disable_all_nodes‘=>true,289‘pages‘=>array(290array(‘url‘=>‘http:/..
分类:其他好文   时间:2014-08-30 02:28:09    阅读次数:1092
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!