码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
[LeetCode] Different Ways to Add Parentheses
Different Ways to Add ParenthesesGiven a string of numbers and operators, return all possible results from computing all the different possible ways t...
分类:其他好文   时间:2015-07-28 00:24:47    阅读次数:137
【LeetCode 241】Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. Th...
分类:其他好文   时间:2015-07-27 18:14:31    阅读次数:116
Huawei English Corner
KeywordsDescriptionsFWIWFor what it's worth(不管结果怎样)ASAPAs Soon As Possible(尽快)FYIFor Your Information(信息供您参考)AFAIKAs Far As I Know(据我所知)LMKLet Me Know...
分类:其他好文   时间:2015-07-27 12:53:55    阅读次数:86
leetCode 93.Restore IP Addresses (恢复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-07-27 11:12:45    阅读次数:645
Project Euler:Problem 93 Arithmetic expressions
By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, ?, *, /) and brackets/parentheses, it is possible to form different positiv...
分类:其他好文   时间:2015-07-26 19:21:34    阅读次数:378
[leedcode 131] Palindrome Partitioning
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类:其他好文   时间:2015-07-26 15:24:54    阅读次数:98
[leetcode]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 mu...
分类:其他好文   时间:2015-07-25 21:33:08    阅读次数:124
[LeetCode][JavaScript]String to Integer (atoi)
String to Integer (atoi)Implementatoito convert a string to an integer.Hint:Carefully consider all possible input cases. If you want a challenge, plea...
分类:编程语言   时间:2015-07-25 21:27:39    阅读次数:243
leetCode 87.Scramble String (拼凑字符串) 解题思路和方法
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-07-25 10:44:04    阅读次数:128
leetCode 90.Subsets II(子集II) 解题思路和方法
Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain du...
分类:其他好文   时间:2015-07-25 10:43:06    阅读次数:113
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!