LeetCode
请叫我子鱼
这个作者很懒,什么都没留下…
展开
-
LeetCode110 - Balanced Binary Tree
[Q]Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node neve原创 2015-03-27 16:41:29 · 392 阅读 · 0 评论 -
算法面试
算法面试通关40讲知识点Array理论Access: O(1)Insert: 平均O(n)Delete: 平均O(n)Singly Linked List & Doubly Linked List理论space: O(n)prepend: O(1)append: O(1)lookup: O(n)insert: O(1)delete: O(...原创 2019-04-08 23:18:42 · 245 阅读 · 0 评论 -
LeetCode104 - Maximum Depth of Binary Tree
[Q]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.[C]/** * Definition f原创 2015-03-27 16:52:31 · 316 阅读 · 0 评论