从1到9构成的九位数中,其中每一位至个位数构成的数字都能被其位置所整除。得出来的9位数字唯一。
数独游戏也很有意思,有空写一个,主要利用递归、主动线性检测策略。
// .h
class CDATAstruct
{
public:
CDATAstruct(void);
~CDATAstruct(void);
//------------------------------------------------
static int numberlevel;
static std::vector<int> m_list;
static void GenerateSpecialNumber();
static void GenerateSpecialNumber(int mdigit, std::vector<int> &mlist);
static BOOL GetLevelNum(int total, int level, std::vector<int> existnum );
static BOOL numinvector(int num, std::vector<int> vec);
};
// .cpp
int CDATAstruct::numberlevel = 10;
std::vector<int> CDATAstruct::m_list;
void CDATAstruct::GenerateSpecialNumber(int mdigit, std::vector<int> &mlist)
{
CDATAstruct::numberlevel=mdigit;
m_list.clear();
GenerateSpecialNumber();
for (int i=0; i<(int)m_list.size(); i++)
{
mlist.push_back( m_list[i]);
}
}
void CDATAstruct::GenerateSpecialNumber()
{
std::vector<int> existnum;
existnum.push_back(0);
GetLevelNum(0,0,existnum);
}
BOOL CDATAstruct::GetLevelNum(int total, int level,
std::vector<int> existnum ){
CString temp;
// 被level整除并且位数达到,退出
if ( total!=0 && level !=0 && total%level ==0 && level == numberlevel)
{
m_list.push_back(total);
temp.Format(_T("total: %d, level: %d"), total, level);
//AfxMessageBox(temp);
return TRUE;
}
for( int i = 1; i <= 9 ; i++ )
{
if (numinvector(i, existnum))
{
continue;
}
if ( level == 0 || total%level == 0 )
{
int val = total*10+i;
existnum.push_back(i);
BOOL bexist = GetLevelNum(val, level+1, existnum);
if (!bexist)
{
existnum.pop_back();
}
}
}
return FALSE;
}
BOOL CDATAstruct::numinvector(int num, std::vector<int> vec)
{
int size = (int)vec.size();
BOOL bexist = FALSE;
for (int i=0; i<size; i++)
{
if ( num == vec[i])
bexist = TRUE;
}
return bexist;
}
// 外部调用,MFC
UpdateData(TRUE);
std::vector<int> mlist;
CString csn;
m_list.ResetContent();
mlist.clear();
CDATAstruct::GenerateSpecialNumber(m_digit, mlist);
for ( int i = 0; i< (int)mlist.size(); i++ )
{
csn.Format(_T("%d"), mlist[i]);
m_list.AddString(csn);
}
this->UpdateData(FALSE);