您的位置:首页 > 编程语言

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

2013-09-13 14:51 375 查看
使用递归方法

#include<iostream>
using namespace std;

char num_char[10][5]={
"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"
};
int total[10]={0,0,3,3,3,3,3,4,3,4};
const int length=3;
int number[length]={1,3,4};
int answer[length]={0};
void search(int *number,int *answer,int index,int n)
{
if (index==n)
{
for (int i=0;i<n;i++)
{
cout<<num_char[number[i]][answer[i]]<<"";
}
cout<<"  ";
return;
}
if (total[number[index]]==0)
{
search(number,answer,index+1,n);
}
else
{
for (answer[index]=0;answer[index]<total[number[index]];answer[index]++)
{
search(number,answer,index+1,n);
}
}

}
int main()
{
int n;
n=length;
search(number,answer,0,n);
cout<<endl;
return 0;
}


 
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: