码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
leetcode——String to Integer (atoi) 字符串转换为整型数(AC)
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 the possible input ca...
分类:其他好文   时间:2014-06-07 12:21:30    阅读次数:284
【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-06-06 17:50:38    阅读次数:284
leetcode-Subsets
Subsets  Total Accepted: 13267 Total Submissions: 48509My Submissions Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-desc...
分类:其他好文   时间:2014-06-02 10:28:35    阅读次数:186
LeetCode: String to Interger (atoi) 题解
Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, please do not see below and ...
分类:其他好文   时间:2014-06-02 08:51:43    阅读次数:233
【leetcode】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,1]. 分析: ...
分类:其他好文   时间:2014-06-01 15:04:42    阅读次数:259
【leetcode】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], [1,2,1], and...
分类:其他好文   时间:2014-06-01 13:03:12    阅读次数:324
LeetCode: Restore IP Addresses [093]
【题目】 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 not matter) 【题意】 给定一个字符串,恢复并返回所有符合条件的IP串 【思路】...
分类:其他好文   时间:2014-06-01 13:01:56    阅读次数:295
LeetCode: Scramble String [87]
【题目】 Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representation of s1 = "great": great / gr eat / \ / g r e at / ...
分类:其他好文   时间:2014-06-01 09:41:05    阅读次数:196
LeetCode: Subsets II [091]
【题目】 Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a subset must be in non-descending order. The solution set must not contain duplicate subsets. For example, If S = [1,2,2], a solution ...
分类:其他好文   时间:2014-06-01 08:51:06    阅读次数:292
leetCode解题报告5道题(九)
题目一:CombinationsGiven two integersnandk, return all possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a solution is:[ [2,4],....
分类:其他好文   时间:2014-05-31 20:01:02    阅读次数:455
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!