Fork me on GitHub
2017年3月29日
[leetcode-107-Binary Tree Level Order Traversal II]
摘要： 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 @ 2017-03-29 21:58 hellowOOOrld 阅读(187) 评论(0) 推荐(0)
[leetcode-102-Binary Tree Level Order Traversal]
摘要： 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 [ 阅读全文
posted @ 2017-03-29 21:45 hellowOOOrld 阅读(701) 评论(0) 推荐(0)
[leetcode-77-Combinations]
摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3, 阅读全文
posted @ 2017-03-29 17:18 hellowOOOrld 阅读(217) 评论(0) 推荐(0)