wangzq的专栏

1、Subsets Total Accepted: 7967 Total Submissions: 29509 My Submissions Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order.

1、Combinations  Total Accepted: 8363 Total Submissions: 28177 My Submissions Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k =

Permutation Sequence Total Accepted: 3033 Total Submissions: 14751 My Submissions The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in o

Next Permutation Total Accepted: 4075 Total Submissions: 16219 My Submissions Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If

1、Permutations Total Accepted: 6396 Total Submissions: 20594 My Submissions Given a collection of numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [