2015年3月22日
Merge Sorted Array——LeetCode
摘要： Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal... 阅读全文
posted @ 2015-03-22 22:24 丶Blank 阅读(179) 评论(0) 推荐(0)
Symmetric Tree——LeetCode
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ ... 阅读全文
posted @ 2015-03-22 18:07 丶Blank 阅读(171) 评论(0) 推荐(0)
Binary Tree Level Order Traversal II——LeetCode
摘要： Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa... 阅读全文
posted @ 2015-03-22 14:01 丶Blank 阅读(169) 评论(0) 推荐(0)
Balanced Binary Tree——LeetCode
摘要： 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... 阅读全文
posted @ 2015-03-22 12:07 丶Blank 阅读(172) 评论(0) 推荐(0)
Minimum Depth of Binary Tree ——LeetCode
摘要： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2015-03-22 00:18 丶Blank 阅读(204) 评论(0) 推荐(0)