本文共 1045 字，大约阅读时间需要 3 分钟。

class Solution {//get the current whole set by expanding previous whole set//for each element, do one expansion public:	vector
   
    
      > subsets(vector
     
       &S) {		// Start typing your C/C++ solution below		// DO NOT write int main() function		sort(S.begin(), S.end());		vector
      
       
        > ansSet(1);		for (int i = 0; i < S.size(); ++i)		{			int setSize = ansSet.size();			while (setSize-- > 0)			{				ansSet.push_back(ansSet[setSize]);				ansSet.back().push_back(S[i]);//...			}		}		return ansSet;	}};
       
      
     
    
   

second time

class Solution {public:    vector
   
    
      > subsets(vector
     
       &S) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        sort(S.begin(), S.end());        vector
      
       
         > sets(1, vector
        
         ()); for(int i = 0; i < S.size(); ++i) { int oldEnd = sets.size(); for(int j = 0; j < oldEnd; ++j) { vector
         
           tmp = sets[j]; tmp.push_back(S[i]); sets.push_back(tmp); } } return sets; }};
         
        
       
      
     
    
   

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