leetcode 46. 全排列 c++ (回溯排列问题）(回看）2021-07-11

回溯排列问题， 配合used数组， 不用startIndex， 每次回溯都要从头遍历。

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backTracking(vector<int>& nums, vector<bool>& used);
public:
    vector<vector<int>> permute(vector<int>& nums) 
    {
        vector<bool> used(nums.size());
        backTracking(nums, used);
        return result;
    }
};

inline void Solution::backTracking(vector<int>& nums, vector<bool>& used)
{
    if (path.size() == nums.size())
    {
        result.push_back(path);
        return;
    }

    for (int i = 0; i < nums.size(); ++i)
    {
        if (used[i] == true) continue;
        path.push_back(nums[i]);
        used[i] = true;
        backTracking(nums, used);
        used[i] = false;
        path.pop_back();
    }
}