摘要：
Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn't ma 阅读全文
posted @ 2016-02-26 23:02
周洋
阅读(147)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example:Given binary tree {3 阅读全文
posted @ 2016-02-26 17:59
周洋
阅读(268)
评论(0)
推荐(0)
摘要：
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 l 阅读全文
posted @ 2016-02-26 16:58
周洋
阅读(176)
评论(0)
推荐(0)
摘要：
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 l 阅读全文
posted @ 2016-02-26 09:51
周洋
阅读(140)
评论(0)
推荐(0)
摘要：
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 dept 阅读全文
posted @ 2016-02-26 09:42
周洋
阅读(179)
评论(0)
推荐(0)
浙公网安备 33010602011771号