码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
LeetCode-8 String to Integer (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 ...
分类:其他好文   时间:2015-04-25 22:40:26    阅读次数:147
(LeetCode 78)SubSets
Given a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not c...
分类:其他好文   时间:2015-04-25 22:35:18    阅读次数:231
Java [leetcode 8] 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 be...
分类:编程语言   时间:2015-04-25 14:51:50    阅读次数:148
leetcode-17 Letter Combinations of a Phone Number
问题描述: Given a digitstring, return all possible letter combinations that the number couldrepresent. A mapping of digitto letters (just like on the telephone buttons) is given below. Input:Digi...
分类:其他好文   时间:2015-04-24 19:15:54    阅读次数:173
Effective C++ 之 Item 3:尽可能使用 const
Effective C++ Chapter 1. 让自己习惯C++(Accustoming Yourself to C++) Item 3. 尽可能使用 const (Use const whenever possible) 1. const 与语义约束 const 允许指定一个语义约束(也就是指定...
分类:编程语言   时间:2015-04-24 14:09:57    阅读次数:143
[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...
分类:其他好文   时间:2015-04-24 01:04:53    阅读次数:138
合法ip序列
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...
分类:其他好文   时间:2015-04-23 20:00:43    阅读次数:147
Scramble String -- leetcode
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 ...
分类:其他好文   时间:2015-04-23 17:40:47    阅读次数:205
LeetCode (18) Permutations I & 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].本题要求输入一数组,输...
分类:其他好文   时间:2015-04-22 18:36:14    阅读次数:173
Permutations(Leet Code)
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]....
分类:其他好文   时间:2015-04-21 20:45:08    阅读次数:136
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!