![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
[leetcode]
文章平均质量分 65
mengtiantian2002
这个作者很懒,什么都没留下…
展开
-
[leetcode] 357. Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n. Example: Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x [11,22,33,44,原创 2016-11-07 09:52:19 · 129 阅读 · 0 评论 -
【leetcode 343】Integer Break
题目:Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get. For example, given n = 2, re原创 2016-11-08 09:23:52 · 198 阅读 · 0 评论 -
【leetcode 392】Is Subsequence
题目: Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000原创 2016-11-08 10:22:00 · 158 阅读 · 0 评论