题目来源:LeetCode ProblemSet 46
题目描述:Given a collection of distinct 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],
[3,2,1]
]
- class Solution {
- public:
- vector<vector<int>> permute(vector<int>& nums) {
- }
- };
解题思路:这道题其实就是一道简单的排列组合题,按照中学时的解法就是An种情况,每个新的数列第一位可以在n个数取一个,第二位在n-1个数里取一个,依此类推。而用在计算机上,使用递归应该会比较好理解,具体看下面的代码和注释即可。
解题代码:
- class Solution {
- public:
- vector<vector<int>> permute(vector<int>& nums) {
- vector<vector<int>> result;
- int size = nums.size();
- vector<int> temp;
- permute(result, temp, 0, nums, size);
- return result;
- }
- void permute(vector<vector<int>>& result, vector<int> temp, int tempLength, vector<int> nums, int size) {
- if (tempLength >= size) {
- result.push_back(temp);
- return;
- } else {
- for (int i = 0; i < size; i++) {
- int j;
- for (j = 0; j < tempLength; j++) {
- if (nums[i] == temp[j]) {
- break;
- }
- }
- if (j == tempLength) {
- temp.push_back(nums[i]);
- permute(result, temp, tempLength+1, nums, size);
- temp.pop_back();
- }
- }
- }
- }
- };