使用递归方法
#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;
}

本文介绍了一种使用递归方法来实现电话按键对应字母的所有可能组合的算法。通过定义字符数组和递归搜索函数,实现了输入一串数字,输出所有可能的字母组合。该算法适用于解决电话号码快速输入文字的问题。

被折叠的 条评论
为什么被折叠?



