class Solution {public:    vector
   
    
     > permute(vector
     
      & nums) {        vector
      
       
        > ret;        if(nums.size()==0)            return ret;        vector
        
          temp; temp.push_back(nums[0]); ret.push_back(temp); for(int i=1;i
         

直接调用stl中的next_permutation 但是注意调用之前要先排序

class Solution {public:    vector
   
    
     > permute(vector
     
      & nums) {        vector
      
       
        > ret;        if(nums.size()==0)            return ret;       sort(nums.begin(),nums.end());       do{           ret.push_back(nums);       }while(next_permutation(nums.begin(),nums.end()));       return ret;    }};
       
      
     
    
   

转载地址：http://vrked.baihongyu.com/