leetcode 46

通过维护visited数组来判断nums[i]是否已经在输出中，若在则跳过，若不在则将其push进out，进行下次dfs

void permuteDFS(vector<vector<int>>& res,vector<int>& out,vector<int>& nums,vector<int>& visited,int level)
    {
        if(level==nums.size())
            res.push_back(out);
        else
        {
            for(int i=0;i<nums.size();i++)
            {
                if(visited[i]==0)
                    continue;
                visited[i]=0;
                out.push_back(nums[i]);
                permuteDFS(res,out,nums,visited,level+1);
                visited[i]=-1;
                out.pop_back();
            }
        }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        int n=nums.size();
        vector<vector<int>> res;
        vector<int> visited(nums.size(),-1);
        vector<int> out;
        permuteDFS(res,out,nums,visited,0);
        return res;
    }