¡¾LeetCodeÈÈÌâ100¡¿¡¾»ØËÝ¡¿È«ÅÅÁÐ

class Solution {
public:
    vector<bool> visited;
    vector<vector<int> > ans;

    void dfs(vector<int> &array, vector<int> &nums) {
        if (array.size() == nums.size()) {
            ans.push_back(array);
            return;
        }
        for (int i = 0; i < nums.size(); i++) {
            if (visited[i] == false) {
                visited[i] = true;
                array.push_back(nums[i]);
                dfs(array, nums);
                array.pop_back();
                visited[i] = false;
            }
        }
    }

    vector<vector<int> > permute(vector<int> &nums) {
        visited.assign(nums.size(), false);
        vector<int> array;
        dfs(array, nums);
        return ans;
    }
};