
int a[5]
int len1,len2,len3
void input(int len1,int len2,int len3)
{
printf("%d %d %d\n",a[len1],a[len2],a[len3])
}
void solve(int len1,int len2,int len3)
{
input(len1,len2,len3)
if(len1==2) return
if(len3<4) len3++
else if(len2<3)
{
len2++
len3=len2+1
}
else if(len1<2)
{
len1++
len2=len1+1
len3=len2+1
}
solve(len1,len2,len3)
}
void main()
{
int i
for(i=0i<和汪5i++) a[i]=i+1
printf("嫌汪所构芹棚仔成组合是:\n")
solve(0,1,2)
return
}
CTestPermutation::~CTestPermutation(){
cout<<">>竖亏旅>>>空磨>>>>>>>>>>>>>>>>>>>CTestPermutation::~CTestPermutation()"<<endl
}
void CTestPermutation::DoTest()
{
cout<<"-------将余凳N个数进行排列组合-------"<<endl<<endl
vector<int>vecNums,vecPermutated
cout<<"示例数据:"
for(int i = 1i <5i++)
{
vecNums.push_back(i)
cout<<i<<" "
}
cout<<endl
cout<<"排列组合结果:"<<endl
Permutation(vecPermutated,vecNums)
}
欢迎分享,转载请注明来源:内存溢出
微信扫一扫
支付宝扫一扫
评论列表(0条)