码迷,mamicode.com
首页 >  
搜索关键字:its    ( 9997个结果
LeetCode:BInary Tree Inorder Traversal(二叉树的中序遍历)
Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]...
分类:其他好文   时间:2015-08-12 13:09:34    阅读次数:123
LeetCode:Binary Tree Postorder Traversal
Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,...
分类:其他好文   时间:2015-08-12 13:04:05    阅读次数:109
leetcode: Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return [1,2,3]. Note: Recursive soluti...
分类:其他好文   时间:2015-08-11 23:34:22    阅读次数:131
LeetCode:Rectangle Area
Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as sh...
分类:其他好文   时间:2015-08-11 21:23:38    阅读次数:109
23.Merge k Sorted Lists (Array; Sort)
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路I: 选择排序每次都比较各个list的头指针所指的val,取最小的那个。时间复杂度O(n2)Result...
分类:其他好文   时间:2015-08-11 20:47:38    阅读次数:121
LeetCode:Maximus Square(DP)
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matr...
分类:其他好文   时间:2015-08-11 18:23:52    阅读次数:95
仿oschina 主界面的实现(一) -------FragmentTabHost+Fragment
FragmentTabHost+Fragment 官网的API dome Special TabHost that allows the use of Fragment objects for its tab content. When placing this in a view hierarchy, after inflating the hierarchy you must ca...
分类:其他好文   时间:2015-08-11 12:15:25    阅读次数:170
Binary Tree Zigzag Level Order Traversal
Binary Tree Zigzag Level Order Traversal Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alte...
分类:其他好文   时间:2015-08-11 12:14:03    阅读次数:108
Get the 1,000- Foot View
?Get the 1,000- Foot ViewErik DoernenburgAS ARCHiTECTS, WE WAnT To KnoW how good the software is that we are developing. Its quality has an obvious external aspect—the software should be of value to it...
分类:其他好文   时间:2015-08-11 10:09:28    阅读次数:112
【LeetCode-面试算法经典-Java实现】【111-Minimum Depth of Binary Tree(二叉树的最小深度)】
【111-Minimum Depth of Binary Tree(二叉树的最小深度)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a binary tree, find its minimum depth.   The minimum depth is the number of nodes along the shortest path from t...
分类:编程语言   时间:2015-08-11 08:33:30    阅读次数:128
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!