2015年10月19日
LeetCode OJ：Minimum Depth of Binary Tree（二叉树的最小深度）
摘要： 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-10-19 20:24 eversliver 阅读(319) 评论(0) 推荐(0)
LeetCode OJ：Rotate Array（倒置数组）
摘要： Rotate an array ofnelements to the right byksteps.For example, withn= 7 andk= 3, the array[1,2,3,4,5,6,7]is rotated to[5,6,7,1,2,3,4].将数组的内容倒置，看例子就知道是... 阅读全文
posted @ 2015-10-19 19:23 eversliver 阅读(413) 评论(0) 推荐(0)
LeetCode OJ：Balanced Binary Tree（平衡二叉树）
摘要： 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-10-19 10:02 eversliver 阅读(303) 评论(0) 推荐(0)