Spell It Rirht (Stack的使用）

1005 Spell It Right （20 分）

Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.

Input Specification:

Each input file contains one test case. Each case occupies one line which contains an N (≤10​100​​).

Output Specification:

For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line.

Sample Input:

12345

Sample Output:

one five

思路：

1、输入的数字最大到10^100，显然超出了Int和Long的范围，在java中可以使用大整数BigInteger这个类，

可以存储的范围：-2eInteger.MAX_VALUE (exclusive) to +2eInteger.MAX_VALUE (exclusive).

2、也可以把读入的当作一个字符串，即in.next(),然后转化为字符数组，再逐一变为int求和。

3、从一个整型的最高位开始读，要使用栈 Stack，先把低位压进去，就可以先取出高位。

import java.math.BigInteger;
import java.util.Scanner;
import java.util.Stack;

public class Main {
	static int flag=0;
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner (System.in);
		BigInteger n = in.nextBigInteger();
		int sum = 0;
		while(n.compareTo(BigInteger.valueOf(0))>0) {
			sum+=n.mod(BigInteger.valueOf(10)).intValue();
			n = n.divide(BigInteger.valueOf(10));
		}
		
		Stack<Integer> st = new Stack<>();
		if(sum==0)
			st.push(0);
		
		while(sum!=0) {
			st.push(sum%10);
			sum = sum/10;
		}
		
		
		
		while(!st.isEmpty()) {
			switch (st.pop()) {
			case 0 :sop("zero");break;
			case 1 :sop("one");break;
			case 2 :sop("two");break;
			case 3 :sop("three");break;
			case 4 :sop("four");break;
			case 5 :sop("five");break;
			case 6 :sop("six");break;
			case 7 :sop("seven");break;
			case 8 :sop("eight");break;
			case 9 :sop("nine");break;
			
			}
		}
	}

	private static void sop(String string) {
		// TODO Auto-generated method stub
		if(flag == 0) {
			System.out.print(string);
			flag =1;
		}
		else 
			System.out.print(" "+string);	
	}
}