class Solution
{
public:
vector<vector<int> > permute(vector<int> &num)
{
vector<vector<int> > ret;
sort(num.begin(), num.end());
ret.push_back(num);
while(next_permutation(num.begin(), num.end()))
{
ret.push_back(num);
}
return ret;
}
};
leetcode - 46. Permutations
最新推荐文章于 2022-03-05 21:58:54 发布