码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
LeetCode Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]...
分类:其他好文   时间:2015-04-07 17:42:16    阅读次数:94
leetcode-8 String to Integer (atoi)
?? 问题描述: Implement atoi to convert a string to an integer. Hint: Carefullyconsider all possible input cases. If you want a challenge, please do not seebelow and ask yourself what are the p...
分类:其他好文   时间:2015-04-07 17:41:26    阅读次数:133
Leetcode---word Break II
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s = "...
分类:其他好文   时间:2015-04-07 10:09:29    阅读次数:91
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 must not contain duplicate subsets. For exam...
分类:其他好文   时间:2015-04-07 10:05:03    阅读次数:127
LeetCode78/90 subset I/II
一:Unique paths I 题目: 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 contain duplic...
分类:其他好文   时间:2015-04-06 15:44:07    阅读次数:122
Letter Combinations of a Phone Number——LeetCode
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-06 15:30:40    阅读次数:107
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 co...
分类:其他好文   时间:2015-04-06 15:29:43    阅读次数:123
47.Permutations 1&2
1.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],[...
分类:其他好文   时间:2015-04-06 15:25:46    阅读次数:137
Palindrome Partitioning——LeetCode
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv...
分类:其他好文   时间:2015-04-05 15:53:15    阅读次数:107
hdu 2962 Trucking 最短路+二分。。Dijkstra+SPFA两种算法实现。
Problem Description A certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to transport as much goods as possible each trip. Unfortunately, one cannot always use the roads in the shor...
分类:编程语言   时间:2015-04-05 09:16:13    阅读次数:208
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!