码迷,mamicode.com
首页 >  
搜索关键字:minimum span tree    ( 79922个结果
Problem Path Sum II
Problem Description:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Solution: 递归。 1 public List>...
分类:其他好文   时间:2014-07-07 16:59:12    阅读次数:169
Problem Binary Tree Postorder Traversal
Problem Description:Given a binary tree, return thepostordertraversal of its nodes' valuesSolution: 1 public List postorderTraversal(TreeNode root) { ...
分类:其他好文   时间:2014-07-07 16:45:23    阅读次数:177
[Leetcode][Tree][Binary Tree Level Order Traversal ]
树的层次遍历,比较简单,3个题的做法完全一样,只是在特定的地方对结果进行reverse。1、Binary Tree Level Order Traversal/** * Definition for binary tree * struct TreeNode { * int val; * ...
分类:其他好文   时间:2014-07-07 16:39:56    阅读次数:194
Problem Binary Tree Preorder Traversal
Problem Description:Given a binary tree, return thepreordertraversal of its nodes' values.Solution: 1 public List preorderTraversal(TreeNode root)...
分类:其他好文   时间:2014-07-07 16:34:34    阅读次数:208
[Leetcode][Tree][Same Tree]
非常简单的一道题/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x...
分类:其他好文   时间:2014-07-07 16:25:49    阅读次数:220
eclipse 安装scons
http://www.sconsolidator.com/updateInstallationTo use SConsolidator, you first have to installSCons(version 2.0 is the minimum requirement). SConsolid...
分类:系统相关   时间:2014-07-07 16:19:42    阅读次数:458
Minimum Path Sum
题目 Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move either down...
分类:其他好文   时间:2014-06-30 11:10:34    阅读次数:211
extjs_07_combobox&tree&chart
extjs_07_combobox&tree&chart...
分类:Web程序   时间:2014-06-30 10:29:38    阅读次数:259
Edit Distance
题目 Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operations permitte...
分类:其他好文   时间:2014-06-30 00:46:38    阅读次数:262
Minimum Window Substring
题目 Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example, S = "ADOBECODEBANC" T = "ABC" Minimum wi...
分类:Windows程序   时间:2014-06-29 20:38:14    阅读次数:239
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!