1005. Spell It Right (20)
递归先输出第一个数字
#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
char str[102];
char num[11][20]={"zero","one","two","three","four","five","six","seven","eight","nine"};
void print(int sum){
int last=sum%10;
sum/=10;
if(sum){
print(sum);
}
else{
printf("%s",num[last]);
return;
}
printf(" %s",num[last]);
}
int main(){
gets(str);
int sum=0;
for(int i=0;str[i];i++)
sum+=str[i]-'0';
print(sum);
return 0;
}
/*统计 树的每层的叶子节点个数
一个节点没有孩子则称为叶子节点
*/