一、题目链接
给定一个不含重复数字的数组 nums
,返回其所有可能的全排列。
示例 1:
输入:nums = [1,2,3]
输出:[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
示例 2:
输入:nums = [0,1]
输出:[[0,1],[1,0]]
示例 3:
输入:nums = [1]
输出:[[1]]
二、题解
通过回溯法求解,时间复杂度与空间复杂度均为 O ( n 2 ) O(n^2) O(n2):
class Solution {
private:
vector<vector<int>> result;
vector<int> each_case;
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<bool> records(nums.size(), false);
backtracking(nums, records);
return result;
}
void backtracking(vector<int> &nums, vector<bool> &records) {
if (each_case.size() == nums.size()) {
result.emplace_back(each_case);
}
for (int i = 0; i < nums.size(); i++) {
if (!records.at(i)) {
each_case.emplace_back(nums.at(i));
records.at(i) = true;
backtracking(nums, records);
each_case.pop_back();
records.at(i) = false;
}
}
}
};