class Solution {

public:

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

    }

};

Input: nums = [1,2,3]

Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]

​

/**

 * Return an array of arrays of size *returnSize.

 * The sizes of the arrays are returned as *returnColumnSizes array.

 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().

 */

int** permute(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){

​

}

/**

 * @param {number[]} nums

 * @return {number[][]}

 */

var permute = function(nums) {

};

class Solution {

    func permute(_ nums: [Int]) -> [[Int]] {

    }

}

class Solution {

​

    /**

     * @param Integer[] $nums

     * @return Integer[][]

     */

    function permute($nums) {

    }

}

function permute(nums: number[]): number[][] {

​

};

class Solution {

public:

    vector<vector<int>> permuteUnique(vector<int>& nums) {

    }

};

class Solution {

    public List<List<Integer>> permuteUnique(int[] nums) {

    }

}

​

/**

 * Return an array of arrays of size *returnSize.

 * The sizes of the arrays are returned as *returnColumnSizes array.

 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().

 */

int** permuteUnique(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){

​

}

public class Solution {

    public IList<IList<int>> PermuteUnique(int[] nums) {

    }

}