<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 {

private:
   vector<vector<int>> recursePermute(vector<int>& nums, int index){
    vector<vector<int>> response;
      if (index==nums.size()-1) {
        response.push_back(nums);
        return response;
      }
     vector<vector<int>> res =  recursePermute(nums,index+1);
      
      for(int i=0;i<res.size();++i){
        response.push_back(res[i]);
         for(int j=index+1;j<nums.size();++j) {
              vector<int> permutted = res[i];
              swap(permutted[index],permutted[j]);
              response.push_back(permutted);
         }
      } 
      return response;
   }

public:
    vector<vector<int>> permute(vector<int>& nums) {
      return recursePermute(nums,0);
    }
};
9500