导航

上一页 1 2 3 4 5 6 7 8 9 ··· 12 下一页

2016年9月5日

摘要: 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-09-05 17:07 CSU蛋李 阅读(108) 评论(0) 推荐(0) 编辑

摘要: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For 阅读全文

posted @ 2016-09-05 16:52 CSU蛋李 阅读(81) 评论(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-09-05 14:55 CSU蛋李 阅读(90) 评论(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-09-05 14:15 CSU蛋李 阅读(94) 评论(0) 推荐(0) 编辑

2016年8月28日

摘要: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文

posted @ 2016-08-28 15:45 CSU蛋李 阅读(107) 评论(0) 推荐(0) 编辑

2016年8月8日

摘要: 牛客网华为机试在线训练字符串最后一个单词的长度 阅读全文

posted @ 2016-08-08 16:05 CSU蛋李 阅读(287) 评论(0) 推荐(0) 编辑

摘要: LeetCode 118. Pascal's Triangle 阅读全文

posted @ 2016-08-08 15:10 CSU蛋李 阅读(145) 评论(0) 推荐(0) 编辑

摘要: LeetCode 119. Pascal's Triangle II 阅读全文

posted @ 2016-08-08 13:37 CSU蛋李 阅读(123) 评论(0) 推荐(0) 编辑

摘要: LeetCode 121. Best Time to Buy and Sell Stock 阅读全文

posted @ 2016-08-08 11:14 CSU蛋李 阅读(158) 评论(0) 推荐(0) 编辑

摘要: LeetCode 125. Valid Palindrome 阅读全文

posted @ 2016-08-08 10:50 CSU蛋李 阅读(144) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 7 8 9 ··· 12 下一页