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
猜你喜欢
转载自blog.csdn.net/weixin_41938758/article/details/89074405
今日推荐
周排行