1002. 写出这个数 (20)

读入一个自然数n，计算其各位数字之和，用汉语拼音写出和的每一位数字。

输入格式：每个测试输入包含1个测试用例，即给出自然数n的值。这里保证n小于10100。

输出格式：在一行内输出n的各位数字之和的每一位，拼音数字间有1 空格，但一行中最后一个拼音数字后没有空格。
输入样例：

1234567890987654321123456789

输出样例：

yi san wu

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

public static void main(String args[]) {
Scanner cin = new Scanner(System.in);
while (cin.hasNext()) {
String str = cin.nextLine();
int sum = 0;
for (int i = 0; i < str.length(); i++) {
sum += str.charAt(i) - '0';
}
int gewei = sum % 10;
sum /= 10;
int shiwei = sum % 10;
sum /= 10;
int baiwei = sum % 10;
if (baiwei == 0) {
if (shiwei == 0) {
System.out.println(invertToPinYin.get(gewei));
} else {
System.out.println(invertToPinYin.get(shiwei) + " "
+ invertToPinYin.get(gewei));
}
} else {
System.out.println(invertToPinYin.get(baiwei) + " "
+ invertToPinYin.get(shiwei) + " "
+ invertToPinYin.get(gewei));
}
}
}

public static Map<Integer, String> invertToPinYin = new HashMap<Integer, String>() {
{
put(0, "ling");
put(1, "yi");
put(2, "er");
put(3, "san");
put(4, "si");
put(5, "wu");
put(6, "liu");
put(7, "qi");
put(8, "ba");
put(9, "jiu");
}
};
}

#include <iostream>
#include <string>
using namespace std;

string invertToPinYin (int num) {
switch(num) {
case 1:return "yi"; break;
case 2:return "er"; break;
case 3:return "san"; break;
case 4:return "si"; break;
case 5:return "wu"; break;
case 6:return "liu"; break;
case 7:return "qi"; break;
case 8:return "ba"; break;
case 9:return "jiu"; break;
case 0:return "ling"; break;
}
}
int main() {
string str;
int i;
while(cin>>str) {
int sum = 0;
for(i=0; i<str.length(); i++) {
sum += str[i] - '0';
}
int gewei = sum % 10;
sum /= 10;
int shiwei = sum % 10;
sum /= 10;
int baiwei = sum % 10;
if(baiwei == 0) {
if(shiwei == 0) {
cout<<invertToPinYin(gewei)<<endl;
}else {
cout<<invertToPinYin(shiwei)<<" ";
cout<<invertToPinYin(gewei)<<endl;
}
}else {
cout<<invertToPinYin(baiwei)<<" ";
cout<<invertToPinYin(shiwei)<<" ";
cout<<invertToPinYin(gewei)<<endl;
}

}
return 0;
}