test.cpp

关于数学组合题的解法.用模板类+回归函数实现,思路简单清晰.这是我在索贝数码公司时接到的一道应聘题.含有算法描述文档.

// Test.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"

int num[8]={0,1,2,3,4,5,6,7};
int * iPtr=NULL;
void CInter(int startNum,int allCount,int GroupNum,int iHorizontal)
{
   if (iHorizontal>=(GroupNum-1)) 
   {
	   for (startNum;startNum<allCount;startNum++)
	   { 
		   iPtr[GroupNum-1]=num[startNum];
		   for (int i=0;i<GroupNum;i++)
		  {
		     cout<<'['<<iPtr[i]<<']'<<' ';		  
		  }
	      cout<<endl;
	   }
   }
   else
   for (startNum;startNum<=allCount-GroupNum+iHorizontal;startNum++)
   {
	   
	   iPtr[iHorizontal]=num[startNum];
	   int start=startNum+1;
	   int iHor=iHorizontal+1;
	   CInter(start,allCount,GroupNum,iHor);	    
   }
}
void C(int allCount,int GroupNum)
{
  iPtr=new int[GroupNum];
  CInter(0,allCount,GroupNum,0);
}
///////

//////

int main(int argc, char* argv[])
{
	C(8,3);
	return 0;
}