import java.util.Deque;
import java.util.LinkedList;
import java.util.Stack;
public class demo02 {
private String[] hanArr = {“零”, “壹”, “贰”, “叁”, “肆”,
“伍”, “陆”, “柒”, “捌”, “玖”};
private String[] unitArr = {“十”, “百”, “千”};
public String hanStr(String numStr){
String result="";
boolean flag=true;
int len=numStr.length();
int i=0;
for (; i < len; i++) {
if(flag && numStr.charAt(i)=='0'){
continue;
}else{
flag=false;
int index=numStr.charAt(i)-'0';
if(i!=len-1&&index!=0){
result+=hanArr[index]+unitArr[len-2-i];
}else{
//最后一位 并且不为零
if(index!=0){
result+=hanArr[index];
}else{
//最后一位 为零
//不是最后一位 为零
int k=i;
while(k<len){
k++;
if(k!=len&&numStr.charAt(k)=='0')continue;
else break;
}
if(k==len)return result;
else {
result+=hanArr[0];
i=k-1;
};
}
}
}
}
return result;
}
public static void main(String[] args) {
System.out.println(new demo02().hanStr("5007"));
System.out.println(new demo02().hanStr("5000"));
System.out.println(new demo02().hanStr("0010"));
System.out.println(new demo02().hanStr("0310"));
}
}