码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
LeetCode: Subsets
LeetCode: SubsetsGiven a set of distinct integers, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The soluti...
分类:其他好文   时间:2014-08-31 22:53:32    阅读次数:250
LeetCode: Restore IP Addresses
LeetCode: Restore IP AddressesGiven a string containing only digits, restore it by returning all possible valid IP address combinations. For example:G...
分类:其他好文   时间:2014-08-31 22:48:42    阅读次数:314
LeetCode——Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible...
分类:其他好文   时间:2014-08-30 20:30:10    阅读次数:254
Inviting Friends(hdu3244 && zoj3187)完全背包+二分
Inviting FriendsTime Limit: 1 Second Memory Limit: 32768 KBYou want to hold a birthday party, inviting as many friends as possible, but you have to pr...
分类:其他好文   时间:2014-08-30 15:06:49    阅读次数:301
They Are An Substitute To Other Bags Specifically The Backpack
Your partner will be willing to compromise by getting someone to build a stake in the company as possible for the family when he or she is called to c...
分类:其他好文   时间:2014-08-29 12:50:27    阅读次数:386
Subsets系列
SubsetsGiven 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...
分类:其他好文   时间:2014-08-28 17:58:05    阅读次数:356
LeetCode 45 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-08-28 14:52:49    阅读次数:158
LeetCode 46 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 [2,1,1]. ...
分类:其他好文   时间:2014-08-28 14:51:19    阅读次数:148
LeetCode 30 Next Permutation
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible o...
分类:其他好文   时间:2014-08-28 11:34:29    阅读次数:241
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 per...
分类:其他好文   时间:2014-08-27 21:55:38    阅读次数:242
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!