码迷,mamicode.com
首页 >  
搜索关键字:possible    ( 2665个结果
Leetcode:Subsets 子集生成
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 mus...
分类:其他好文   时间:2014-06-29 00:03:40    阅读次数:272
django orm 批量存储数据
项目中 需要大量数据的保存操作,每条执行save操作效率太低,在官网上找到bull_create 的批量存储方式,效率提高很多Insert in bulkWhen creating objects, where possible, use thebulk_create()method to redu...
分类:其他好文   时间:2014-06-28 23:24:44    阅读次数:594
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. ...
分类:其他好文   时间:2014-06-22 17:51:54    阅读次数:196
CareerCup Facebook Total number of substring palindrome
Write a function for retrieving the total number of substring palindromes.  For example the input is 'abba' then the possible palindromes= a, b, b, a, bb, abba  So the result is 6.  Updated at 11...
分类:其他好文   时间:2014-06-21 23:59:42    阅读次数:422
Leetcode:Letter Combinations of a Phone Number 手机键盘字母映射
Letter Combinations of a Phone Number:Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit...
分类:移动开发   时间:2014-06-21 00:56:16    阅读次数:261
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 telephone buttons) is given below. In...
分类:其他好文   时间:2014-06-18 12:03:16    阅读次数:227
【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], ]...
分类:其他好文   时间:2014-06-18 11:41:52    阅读次数:156
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 perm...
分类:其他好文   时间:2014-06-18 09:33:28    阅读次数:181
HDU-3473Minimum Sum
Problem Description You are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a number x to make as small as possible! ...
分类:其他好文   时间:2014-06-18 00:58:54    阅读次数:276
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 example, ...
分类:其他好文   时间:2014-06-18 00:39:26    阅读次数:301
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!