46. 全排列

class Solution {
public:
    vector>ans;
    vectorpath;
    void dfs(vector& nums,vector&used){
        if(path.size()==nums.size()){
            ans.push_back(path);
            return;
        }
        for(int i=0;i> permute(vector& nums) {
        vector used(nums.size(),false);
        dfs(nums,used);
        return ans;
    }
};