ACM-排列与组合
文章平均质量分 82
LarryNLPIR
专注NLP/IR/Machine Learning/Data Mining
展开
-
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-10-30 05:35:09 · 1480 阅读 · 0 评论 -
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 ord原创 2015-01-12 14:14:33 · 1579 阅读 · 0 评论 -
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 permutations:[1,1,2], [1,2,1], and [2,1,1].思路分析:Pe原创 2014-11-23 12:56:52 · 2331 阅读 · 0 评论 -
LeetCode 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].思路分析:这题是Permutations II问题的简原创 2014-11-23 13:01:17 · 1969 阅读 · 0 评论 -
LeetCode Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312""321"Give原创 2015-04-20 13:29:07 · 1483 阅读 · 0 评论