本题主要需判断的点有两个:
1、零后面紧跟一个非零数时,要先输出一个零(注:多个零连续时也只输出一个零)
2、千万位、百万位、十万位、万位上只要有一位是非零的,那么当读到万位时都必须输出万
细节:
1、当只有一个数时需特判
2、数前数后无空格
3、最后一位数若非零,则只需要输出一个数,因此需特判是否遍历到倒数第二位数了。
刚开始只考虑到了主要点1、2,对空格处理非常模糊不清,(有的输出语句前面加了空格,有的输出语句后面加了空格),导致好几个格式错误,都是因为空格错误不当。
#include<cstdio>
#include<cstdlib>
#include<cstring>
int main(){
#ifdef ONLINE_JUDGE
#else
freopen("1.txt","r",stdin);
#endif
char num[10][5]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
char digit[8][5]={"Yi","Qian","Bai","Shi","Wan","Qian","Bai","Shi"};
char m[11];
int len,index,i=0;
bool flag=false,ling=false; //flag表示'千万'-'万'位上是否全为0;ling代表非0数前面是否有紧随0
scanf("%s",m);
len=strlen(m);
if(m[0]=='0'){
printf("ling");
return 0;
}
if(m[0]=='-'){
printf("Fu ");
i++;
len--;
}
index=9-len;
while(true){
if(m[i]=='0'){
if(flag&&index==4){ //满足条件输出'万 '
printf("%s ",digit[index]);
}
index++;
ling=true;
if(m[i+2]=='\0'){ //到了倒数第二位
if(m[i+1]!='0')printf("ling %s",num[m[i+1]-'0']);
break;
}
if(m[i+1]=='\0')break;
}else{
if(index>=1&&index<=3)flag=true;
if(ling){
printf("ling ");
ling=false;
}
if(m[i+1]=='\0'){ //特判一个数的情况
printf("%s",num[m[i]-'0']);
break;
}
printf("%s %s",num[m[i]-'0'],digit[index++]);
if(m[i+2]=='\0'){ //到了倒数第二位
if(m[i+1]!='0')printf(" %s",num[m[i+1]-'0']);
break;
}else{
printf(" ");
}
}
i++;
}
return 0;
}
第二天一早茅塞顿开,对细节1,2,3作了处理,对于细节1,前面加个特判即可。对于细节2,我觉得对数前无空格进行特别处理相对数后方便很多,只要输出第一个数时前面和后面都不加空格,之后输出的数都只要在前面加上空格,后面不加空格,这样一来就无需顾及到输出最后一个数时不能加空格的情况。对于细节3,我对遍历的位置作了判断,若遍历到了倒数第二位,就直接将倒数第一位特别输出,break。
#include<cstdio>
#include<cstdlib>
#include<cstring>
int main(){
#ifdef ONLINE_JUDGE
#else
freopen("1.txt","r",stdin);
#endif
char num[10][5]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
char digit[8][5]={"Yi","Qian","Bai","Shi","Wan","Qian","Bai","Shi"};
char m[11];
int len,index,i=0;
bool flag=false,ling=false; //flag表示'千万'-'万'位上是否全为0;ling代表非0数前面是否有紧随0
scanf("%s",m);
len=strlen(m);
if(m[0]=='-'){ //判断正负
printf("Fu ");
i++;
len--;
}
index=9-len;
if(m[i+1]=='\0'){ //特判一个数的情况
printf("%s",num[m[i]-'0']);
return 0;
}else{
printf("%s %s",num[m[i++]-'0'],digit[index++]);
}
while(true){
if(m[i]=='0'){
if(flag&&index==4){ //满足条件输出'万 '
printf(" %s",digit[index]);
}
index++;
ling=true;
if(m[i+2]=='\0'){ //以倒数第二位终止(因为最后一位若非零,则只需输出一个数)
if(m[i+1]!='0')printf(" ling %s",num[m[i+1]-'0']);
break;
}
if(m[i+1]=='\0')break; //循环终止条件
}else{
if(index>=1&&index<=3)flag=true;
if(ling){
printf(" ling");
ling=false;
}
printf(" %s %s",num[m[i]-'0'],digit[index++]);
if(m[i+2]=='\0'){ //以倒数第二位终止(因为最后一位若非零,则只需输出一个数)
if(m[i+1]!='0')printf(" %s",num[m[i+1]-'0']);
break;
}
}
i++;
}
return 0;
}
算法笔记中的方法思路清晰,利用left,right简化问题
#include<cstdio>
#include<cstdlib>
#include<cstring>
int main(){
#ifdef ONLINE_JUDGE
#else
freopen("1.txt","r",stdin);
#endif
char num[10][5]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
char digit[5][5]={"Shi","Bai","Qian","Wan","Yi"};
char m[11];
int len,left=0,right;
scanf("%s",m);
len=strlen(m);
right=len-1;
if(m[left]=='-'){
printf("Fu");
left++;
}
while(right>=left+4)right-=4;
while(left<len){
bool ling=false; //判断前面是否有0
bool flag=false; //判断是否有出现非零
while(left<=right){
if(m[left]=='0'){
if(left==0)printf("ling");
ling=true;
} else{
flag=true;
if(left>0)printf(" "); //若不是首位,输出空格
if(ling){
printf("ling ");
ling=false;
}
printf("%s",num[m[left]-'0']);
if(left<right)printf(" %s",digit[right-left-1]);
}
left++;
}
if(flag&&right!=len-1){
printf(" %s",digit[(len-1-right)/4+2]);
}
right+=4;
}
return 0;
}