LeetCode-Permutations
Given a collection of numbers, return all possible permutations.
For example,
[1,2,3]
have the following permutations:
[1,2,3]
, [1,3,2]
, [2,1,3]
, [2,3,1]
, [3,1,2]
, and [3,2,1]
.
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
class Solution { public: void sub(vector<vector<int> > & ret,vector<int>& num,int index){ if(index==num.size()){ ret.push_back(num); return ; } int temp; for(int i=index;i<num.size();i++){ temp=num[i]; num[i]=num[index]; num[index]=temp; sub(ret,num,index+1); temp=num[i]; num[i]=num[index]; num[index]=temp; } } vector<vector<int> > permute(vector<int> &num) { // Note: The Solution object is instantiated only once and is reused by each test case. vector<vector<int> >ret; sub(ret,num,0); return ret; } };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步