<p>Given an array <code>nums</code> of distinct integers, return <em>all the possible permutations</em>. You can return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1,2,3]
<strong>Output:</strong> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [0,1]
<strong>Output:</strong> [[0,1],[1,0]]
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> nums = [1]
<strong>Output:</strong> [[1]]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 6</code></li>
	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
	<li>All the integers of <code>nums</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    void solve(vector<int> str,vector<int> output,int idx,vector<vector<int>> &ans,vector<int> includes){
    int sum=0;
    /*for(auto var : includes)
    {
        sum+=var;
    }*/

    if(output.size() == str.size()){
        ans.push_back(output);
        return;
    }

    for(int i=0;i<str.size();i++){
        if(includes[i] == 1){
            continue;
        }
        output.push_back(str[i]);
        includes[i]=1;
        solve(str,output,idx,ans,includes);
        includes[i] = -1;
        output.pop_back();
    }
}
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> ans;
        vector<int> output;
        vector<int> includes(nums.size(),-1);
        solve(nums,output,0,ans,includes);
        return ans;
    }
};
11700