点击(此处)折叠或打开
- char c[10][10]={
- \"\",
- \"\",
- \"ABC\",
- \"DEF\",
- \"GHI\",
- \"JKL\",
- \"MNO\",
- \"PQRS\",
- \"TUV\",
- \"WXYZ\"
- }
-
- int total[10]={ 0,0,3,3,3,3,3,4,3,4};
- const int TelLength=3;
- int number[TelLength];
- int answer[TelLength];
- //方法一
- while(true)
- {
- for(i=0; i<TelLength; i++)
- printf(\"%c\", 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 Recursion(int *number, int *answer, int index, int n)
- {
- if(index==n)
- {
- for(int i=0; i<n; i++)
- {
- printf(\"%c\", c[number[i]][answer[i]]);
- }
- printf(\"\\n\");
- return;
- }
- for( answer[index]=0; answer[index]<total[number[index]]; answer[index]++)
- {
- RecursiveSearch(number, answer, index+1, n);
- }
- }
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/29012686/viewspace-1145084/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/29012686/viewspace-1145084/