class Solution
{
public:
vector<int> path;
unordered_set<int> uset;
vector<vector<int>> res;
void backtrack(vector<int>& nums)
{
if (path.size() == nums.size())
res.push_back(path);
for (int i = 0; i < nums.size(); i++)
{
if (uset.find(nums[i]) != uset.end())
continue;
path.push_back(nums[i]);
uset.insert(nums[i]);
backtrack(nums);
uset.erase(nums[i]);
path.pop_back();
}
}
vector<vector<int>> permute(vector<int>& nums)
{
backtrack(nums);
return res;
}
};
LeetCode46. 全排列
最新推荐文章于 2024-07-13 13:36:16 发布