2016年6月26日
Number of Digit One
摘要： Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. For example:Given n = 13,Return 阅读全文
posted @ 2016-06-26 17:04 YuriFLAG 阅读(122) 评论(0) 推荐(0)
Sum Root to Leaf Numbers
摘要： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文
posted @ 2016-06-26 10:21 YuriFLAG 阅读(122) 评论(0) 推荐(0)