摘要： http://oj.leetcode.com/problems/subsets/计算一个集合的子集，使用vector >，使用了进制的思想。#include#include#include#includeusing namespace std;class Solution {private: void myoutput(vector &input) { for(int i=0;i > subsets(vector &S) { // Note: The Solution object is instantiated only once and is reused by 阅读全文