摘要：
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 6... 阅读全文
posted @ 2015-08-04 20:13 骄阳照林 阅读(109) 评论(0) 推荐(0) 编辑
摘要：
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to thedefinition of LCA on Wikipedia: “The lowest ... 阅读全文
posted @ 2015-08-04 19:14 骄阳照林 阅读(123) 评论(0) 推荐(0) 编辑
摘要：
Given an array ofnintegers wheren> 1,nums, return an arrayoutputsuch thatoutput[i]is equal to the product of all the elements ofnumsexceptnums[i].Solv... 阅读全文
posted @ 2015-08-04 18:49 骄阳照林 阅读(169) 评论(0) 推荐(0) 编辑