leetcode-46. 全排列

用深度优先遍历递归实现全排列

class Solution {
public:
    vector> permute(vector& nums) {
        int n=nums.size();
        int visited[n];
        for(int i=0;i> vv;
        vector g;
        for(int i=0;i> &vv,int index,int n,vector &g,vector& nums,int visited[]){
        visited[index]=1;
        g.push_back(nums[index]);
        if(g.size()==n){
            vv.push_back(g);

        }else{
            for(int i=0;i