46 Permutations(全排列Medium)

 1 class Solution {
 2 public:
 3     vector<vector<int>> permute(vector<int>& nums) {
 4         vector<vector<int> >ans;
 5         permute1(ans,nums,0);
 6         return ans;
 7     }
 8     void permute1(vector<vector<int>>& ans,vector<int>& nums,int begin) {
 9         if(begin==nums.size()-1){
10             ans.push_back(nums);
11         }
12         for(int i=begin;i<nums.size();++i){
13             swap(nums[i],nums[begin]);
14             permute1(ans,nums,begin+1);
15             swap(nums[i],nums[begin]);
16         }
17     }
18 };