摘要：
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 骄阳照林 阅读(115) 评论(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 骄阳照林 阅读(128) 评论(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 骄阳照林 阅读(173) 评论(0) 推荐(0)
摘要：
Write an efficient algorithm that searches for a value in anmxnmatrix. This matrix has the following properties:Integers in each row are sorted in asc... 阅读全文
posted @ 2015-08-04 17:49 骄阳照林 阅读(107) 评论(0) 推荐(0)
浙公网安备 33010602011771号