递归和非递归求集合的子集

代码

#include <iostream>
#include<string>
#include <vector>
#include <algorithm>
using namespace std;

vector<vector<char>> res;

void getZiji(vector<char> &data)
{
    const int mySize = data.size();
    int Count = res.size();
    int i=0,index=0;
    while (index<mySize)
    {    
        Count = res.size();
        i=0;
        for (;i<Count;i++)
        {
            vector<char> temp;
            temp = res[i];
            temp.push_back(data[index]);
            res.push_back(temp);
        }
        index++;

    }
}
void getZiji(vector<char> &data,int index)
{
    if(0 == index)
    {
        vector<char> temp;
        temp.push_back(data[index]);
        res.push_back(temp);
        return;
    }
    getZiji(data,index-1);
    int Count = res.size();
    for (int i=0;i<Count;i++)
    {
        vector<char> temp;
        temp = res[i];
        temp.push_back(data[index]);
        res.push_back(temp);
    }
}

int main()
{
    vector<char> data;
    data.push_back('a');
    data.push_back('b');
    data.push_back('c');
    vector<char> temp;
    res.push_back(temp);
    
    getZiji(data,data.size()-1);
    return 0;
}