LeetCode-046 Permutations

Description

Given a collection of distinct integers, return all possible permutations.

Example

Input: [1,2,3]
Output:
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]

Analyse

对给定的数列做个全排列，貌似这道题没有检查顺序，这时候就能偷个懒，用我们在031写的Next Permutation直接写就好了。

Code

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> ans;
        vector<int> origin = nums;
        ans.push_back(origin);
        nextPermutation(nums);
        while (origin != nums) {
            ans.push_back(nums);
            nextPermutation(nums);
        }
        return ans;
    }
    void nextPermutation(vector<int>& nums) {
        if (nums.size() == 0) return;
        int i = nums.size() - 2, j;
        while(i >= 0 && nums[i] >=n ums[i+1]) i--;
        if(i >= 0) {  
            j = i + 1;  
            while(j <n ums.size() && nums[j] > nums[i]) j++;  
            j--;
            swap(nums[i], nums[j]);
        }
		i++; j = nums.size() - 1;
		while (i < j) {
			swap(nums[i], nums[j]);
			i++; j--;
		}
	}
};