题目大意
给出一个数组,里面是各不相等的数字,求出所有可能的permutation。
如:
[1,2,3]
[
[1,2,3],
[1,3,2],
[2,1,3],
[2,3,1],
[3,1,2],
[3,2,1]
]
解题思路
假设数组
array={n1,n2,...,nn}
,要求所有的permutation,可以用这个思路,
n1+permutation{n2,n3,...,nn}
n2+permutation{n1,n3,...,nn}
.
.
.
nn+permutation{n1,n3,...,nn−1}
对于
permutation{n1,n2,...,nn}
当
n==1
,
permutation{n1,n2,...,nn}=n1
具体实现的时候可以参考这个例子:
代码
class Solution {
public:
vector<vector<int>> permute(vector<int>& nums) {
vector<vector<int>> resVec;
getPermutations(nums, 0, resVec);
return resVec;
}
private:
void getPermutations(vector<int> numArr, int startInd, vector<vector<int>>& res) {
if (startInd >= numArr.size()) {
res.push_back(numArr);
return;
}
for (int i = startInd; i < numArr.size(); i++) {
swap(numArr[startInd], numArr[i]);
getPermutations(numArr, startInd + 1, res);
swap(numArr[startInd], numArr[i]);
}
}
};