码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
Leetcode#17Letter Combinations of a Phone Number
LetterCombinationsofaPhoneNumberTotalAccepted:39162TotalSubmissions:151116MySubmissionsQuestionSolutionGivenadigitstring,returnallpossiblelettercombinationsthatthenumbercouldrepresent.Amappingofdigittoletters(justlikeonthetelephonebuttons)isgivenbelow.Input..
分类:其他好文   时间:2015-05-18 20:55:38    阅读次数:115
(atoi)Leetcode第八题_String to Integer (atoi)
String to Integer (atoi)Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are th...
分类:其他好文   时间:2015-05-18 16:52:50    阅读次数:125
最大最短距离问题
问题:There are n points in the plane. Your task is to pick k points (k>=2), and make the closest points in these k points as far as possible. 输入:For eac...
分类:其他好文   时间:2015-05-17 16:31:44    阅读次数:170
[LeetCode]93.Restore IP Addresses
题目Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example: Given “25525511135”,return [“255.255.11.135”, “255.255.111.35”]. (Order does no...
分类:其他好文   时间:2015-05-16 00:14:24    阅读次数:145
LeetCode 31 Next Permutation (C,C++,Java,Python)
Problem: Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the l...
分类:编程语言   时间:2015-05-14 16:38:48    阅读次数:146
LeetCode的medium题集合(C++实现)四
1 Next Permutation Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the...
分类:编程语言   时间:2015-05-14 12:08:12    阅读次数:154
So when is Ivy’s birthday
QuestionGary and Henry just become friends with Ivy, and they want to know when her birthday is. Ivy gives them a list of 10 possible dates.January 5 ...
分类:其他好文   时间:2015-05-13 16:03:38    阅读次数:85
[LeetCode] Permutations
Permutations   Given a collection of numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2...
分类:其他好文   时间:2015-05-13 14:50:29    阅读次数:83
[LeetCode] Permutations II
Permutations II   Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [1,1,2...
分类:其他好文   时间:2015-05-13 14:49:21    阅读次数:112
【leetcode】Subsets
Given a set of distinct integers, nums, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must no...
分类:其他好文   时间:2015-05-13 07:37:42    阅读次数:110
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!