[PAT] 1005 Spell It Right （20 分）Java

最新推荐文章于 2022-08-10 23:29:34 发布

转载最新推荐文章于 2022-08-10 23:29:34 发布 · 189 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/PureJava/p/10497941.html

文章标签：

#java

本文详细解析了PAT1005题目的算法实现，该题目要求输入一个非负整数N，计算N所有位数之和，并将每位数字用英文单词表示输出。文章通过使用BigInteger类处理大数运算，遍历字符串计算各位数字之和，再将数字转换为英文单词输出。

Given a non-negative integer

Input Specification:

Each input file contains one test case. Each case occupies one line which contains an

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:

Sample Output:

one five

 1 import java.math.BigInteger;
 2 import java.util.Scanner;
 3 
 4 /**
 5  * @Auther: Xingzheng Wang
 6  * @Date: 2019/2/15 22:01
 7  * @Description: pattest
 8  * @Version: 1.0
 9  */
10 public class PAT1005 {
11 
12     static String[] dig = {"zero","one","two","three","four","five","six","seven","eight","nine"};
13     public static void main(String[] args){
14         Scanner sc = new Scanner(System.in);
15         BigInteger a = sc.nextBigInteger();
16         String b = a.toString();
17         Integer ans = 0;
18         for (int i = 0; i < b.length(); i++) {
19             ans += (int)b.charAt(i) - '0';     //Char存的是ASCII值， -'0'是求其偏移量。
20         }
21         String res = ans.toString();
22         for (int i = 0; i < res.length(); i++) {
23             if(i > 0){
24                 System.out.print(" ");
25             }
26             System.out.print(dig[(int)res.charAt(i) - '0']);
27         }
28     }
29 }