摘要：
题目描述： Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [1,3,2]. 解题思路： 使用栈。从根节点开 阅读全文
posted @ 2016-03-23 15:32
scottwang
阅读(173)
评论(0)
推荐(0)
摘要：
题目描述： Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation 阅读全文
posted @ 2016-03-23 13:51
scottwang
阅读(462)
评论(0)
推荐(0)
浙公网安备 33010602011771号