回溯Leetcode 46 Permutations

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/shey666/article/details/80787318

Leetcode 46

Permutations

• Problem Description：
  经典回溯问题：无重复数字的全排列
  具体的题目信息：
  https://leetcode.com/problems/permutations/description/
• Example:
  
• Solution:

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> res;
        if (nums.size() == 0) return res;
        permutation(nums, 0, res);
        return res;
    }
    void permutation(vector<int>& nums, int i, vector<vector<int>>& res) {
        if (i == nums.size()-1) {
            vector<int> t;
            for (int j = 0; j < nums.size(); j++) {
                t.push_back(nums[j]);
            }
            res.push_back(t);
            return;
        } else {
            for (int j = i; j < nums.size(); j++) {
                swap(nums, i, j);
                permutation(nums, i+1, res);
                swap(nums, j, i);
            }
        }
    }
    void swap(vector<int>& nums, int i, int j) {
        int t = nums[i];
        nums[i] = nums[j];
        nums[j] = t;
    }
};