谁能用递归输出集合N的全部子集啊，

[holmes98]

Write a recursive function to output all subsets of N elements.

[holmes2k]

#include "stdafx.h"
#include <iostream>

using namespace std;

template <class T>
void Subset(T list[], int& b, int& n)
{
if(n == 1 && b == 0 )
{
cout << list[n-1];
cout << endl;
}
else
{
if (b == 1)
{
cout << list[n-1];
b--;
Subset(list, b, n);
}
if(b == 0)
{
b++;
n--;
Subset(list, b, n);
}

}
return;


}


int main(int argc, char* argv[])
{
char a[] = {'1','2','3','4'};
int b = 1;
int n = 4;
Subset(a,b,n);
return 0;
}
我 这个怎么出来乱码，大家帮着看一下

• 打赏
• 举报

回复 赞