mengtiantian2002-CSDN博客

原创【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

原创【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

原创 [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

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

原创 【leetcode 392】Is Subsequence

原创 【leetcode 343】Integer Break

原创 [leetcode] 357. Count Numbers with Unique Digits

空空如也

空空如也

原创【leetcode 392】Is Subsequence

原创【leetcode 343】Integer Break