编程之美——电话号码对应英语单词

编程之美——电话号码对应英语单词

    电话号码盘一般可以用于输入字母。如用2可以输入A,B,C，用3可以输入D,E,F等...

    问题1：可以根据这样的对应关系设计一个程序，尽可能快的从这些字母组合中找到一个有意义的单词来表述一个电话号码呢？

    程序如下：

#include<iostream>
using namespace std;
#define N 4
char c[10][10]={" "," ","ABC","DEF","GHI","JKL","MNO","PQRS","TUV","WXYZ"};
int number[N]={2,4,7,9};
int total[10]={0,0,3,3,3,3,3,4,3,4};
int answer[N];
void Search(int *number,int n); //非递归形式
void RecursiveSearch(int *number,int *answer,int index,int n);//递归形式
int main()
{
  Search(number,N);
  RecursiveSearch(number,answer,0,N);
}
void Search(int *number,int n)
{
  int i;
  while(true)
  {
    for(i=0;i<n;++i)
cout<<c[number[i]][answer[i]]<<" ";
printf("\n");
int k=n-1;
while(k>=0)
{
 if(answer[k]<total[number[k]]-1)
 {
   answer[k]++;
break;
 }
 else
 {
   answer[k]=0;
k--;
 }
}
if(k<0)
break;
  }
}


void RecursiveSearch(int *number,int *answer,int index,int n)
{
  if(index==n)
  {
    for(int i=0;i<n;i++)
cout<<c[number[i]][answer[i]]<<" ";
printf("\n");
return;
  }
  for(answer[index]=0;answer[index]<total[number[index]];answer[index]++)
  {
    RecursiveSearch(number,answer,index,n);
  }
}