码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
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 perm...
分类:其他好文   时间:2014-12-01 15:49:31    阅读次数:182
Palindrome Partitioning
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类:其他好文   时间:2014-11-30 21:18:12    阅读次数:167
Palindrome Partitioning
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类:其他好文   时间:2014-11-28 17:51:41    阅读次数:188
Leetcode-Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类:其他好文   时间:2014-11-28 07:40:57    阅读次数:200
[翻译] M13BadgeView
M13BadgeViewM13BadgeView is a customizable badge view for iOS applications. The badge is built to be customizeable in every way possible, If not custo...
分类:其他好文   时间:2014-11-28 00:55:05    阅读次数:212
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.2...
分类:其他好文   时间:2014-11-27 18:16:58    阅读次数:170
Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon...
分类:其他好文   时间:2014-11-27 15:54:33    阅读次数:135
Combinations
Given two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4], [3,4], [2,3],...
分类:其他好文   时间:2014-11-27 12:20:22    阅读次数:179
[LeetCode] 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 a...
分类:其他好文   时间:2014-11-27 08:00:27    阅读次数:319
[Leetcode]Permutations && Permutations II
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,1]. 组合的题目,第一题无重...
分类:其他好文   时间:2014-11-26 11:21:53    阅读次数:168
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!