2015年10月23日
Leetcode 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 6... 阅读全文
posted @ 2015-10-23 01:42 茜茜的技术空间 阅读(163) 评论(0) 推荐(0)
Leetcode 162. Find Peak Element
摘要： A peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and return its index.... 阅读全文
posted @ 2015-10-23 01:10 茜茜的技术空间 阅读(204) 评论(0) 推荐(0)