2017年9月15日
338. Counting Bits (Medium)
摘要： 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 and r 阅读全文
posted @ 2017-09-15 17:06 Yancea 阅读(169) 评论(0) 推荐(0)
513. Find Bottom Left Tree Value (Medium)
摘要： Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2: Note: You may assume the tree (i.e., the given root no 阅读全文
posted @ 2017-09-15 16:28 Yancea 阅读(107) 评论(0) 推荐(0)