Given a collection of numbers, return all possible permutations.

For example,

[1,2,3] have the following permutations:

[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]

class Solution {

public:

   void DFS(vector<int> &num, int size,vector<int> temp)

    {

        if(size == n){

            result.push_back(temp);

            return ;

        }

        for(int i = ; i< n; i++)

        {

           if(flag[i] == false)

           {

                temp[size] = num[i];

                flag[i] = true;

                DFS(num, size+, temp);

                flag[i] = false;

           }

        }

    }

    vector<vector<int> > permute(vector<int> &num) {

        // Start typing your C/C++ solution below

        // DO NOT write int main() function

        n = num.size();

        result.clear();

        flag.resize(n,false);

        if(n == ) return result;

        vector<int> temp(n,) ;

        DFS(num,,temp);   

        return result ;

    }

private :

   int  n;

   vector<bool> flag;

   vector<vector<int>> result;

};