leetcode Permutations

代码：

#include<iostream>
#include<vector>

using namespace std;

void getResult(vector<vector<int>> &result, vector<int> element, vector<int> nums)
{
    if (element.size() == nums.size())
    {
        result.push_back(element);
    }
    else
    {
        for (int i = 0; i < nums.size(); i++)
        {
            if (find(element.begin(), element.end(), nums[i]) == element.end())
            {
                element.push_back(nums[i]);
                getResult(result, element, nums);
                element.pop_back();
            }
        }
    }
}

vector<vector<int>> permute(vector<int>& nums) 
{
    vector<vector<int>> result;
    vector<int> element;
    getResult(result, element, nums);
    return result;
}

int main()
{
    vector<int> nums = {1,2, 3};
    vector<vector<int>> result = permute(nums);
    cout << result.size() << endl;
    for (int i = 0; i < result.size(); i++)
    {
        for (int j = 0; j < result[i].size(); j++)
            cout << result[i][j] << "    ";
        cout << endl;
    }
}