【PAT甲级火星数字】1100 Mars Numbers (20 分)Java 全部AC

题目

提交Java的时候，千万不要写第一行的包名称！！被这个bug折腾了一个小时。。

题解1：Java

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;public class Main {static String marsGe[] = { "tret", "jan", "feb", "mar", "apr", "may", "jun", "jly", "aug", "sep", "oct", "nov","dec" };static String marsShi[] = { "tret", "tam", "hel", "maa", "huh", "tou", "kes", "hei", "elo", "syy", "lok", "mer","jou" };// 地球个位转火星static String geToMars(int ge) {return marsGe[ge];}// 地球十位转火星static String shiToMars(int shi) {return marsShi[shi];}// 火星转地球个位static int marsToge(String ge) {for (int i = 0; i <= 12; i++) {if (marsGe[i].equals(ge))return i;}return -1;}// 火星转地球十位static int marsToshi(String shi) {for (int i = 0; i <= 12; i++) {if (marsShi[i].equals(shi))return i;}return -1;}// 地球转火星static String toMars(String str) {int num = Integer.parseInt(str);int ge = num % 13;// 个位int shi = num / 13;// 十位if (shi == 0) {return geToMars(ge);} else if (ge == 0) {return shiToMars(shi).trim();} else {return shiToMars(shi) + " " + geToMars(ge);}}// 火星转地球static int toEarth(String str) {String[] arr = null;String shi;String ge;if (str.length() > 5) {// 两个单词arr = str.split(" ");shi = arr[0];ge = arr[1];return marsToshi(shi) * 13 + marsToge(ge);} else {// 一个单词 可能是个位或者十位ge = str;if (marsToge(ge) != -1) {// 不是个位return marsToge(ge);} else {return marsToshi(ge) * 13;}}}public static void main(String[] args) {Scanner sc = new Scanner(System.in);// 总数int total = Integer.parseInt(sc.nextLine());// 读取String[] nums = new String[500];for (int i = 0; i < total; i++) {String line = sc.nextLine();nums[i] = line;}// 转化List<String> res = new ArrayList<>();for (int i = 0; i < total; i++) {if (nums[i].charAt(0) >= '0' && nums[i].charAt(0) <= '9') {// 第一个字符是数字还是字母res.add(toMars(nums[i]));} else {res.add(toEarth(nums[i]) + "");}}// 输出for (String s : res) {System.out.println(s);}}
}

所有输入

所有输出

tret
jan
feb
mar
apr
may
jun
jly
aug
sep
oct
nov
dec
tam
tam jan
tam feb
tam mar
tam apr
tam may
tam jun
tam jly
tam aug
tam sep
tam oct
tam nov
tam dec
hel
hel jan
hel feb
hel mar
hel apr
hel may
hel jun
hel jly
hel aug
hel sep
hel oct
hel nov
hel dec
maa
maa jan
maa feb
maa mar
maa apr
maa may
maa jun
maa jly
maa aug
maa sep
maa oct
maa nov
maa dec
huh
huh jan
huh feb
huh mar
huh apr
huh may
huh jun
huh jly
huh aug
huh sep
huh oct
huh nov
huh dec
tou
tou jan
tou feb
tou mar
tou apr
tou may
tou jun
tou jly
tou aug
tou sep
tou oct
tou nov
tou dec
kes
kes jan
kes feb
kes mar
kes apr
kes may
kes jun
kes jly
kes aug
kes sep
kes oct
kes nov
kes dec
hei
hei jan
hei feb
hei mar
hei apr
hei may
hei jun
hei jly
hei aug
hei sep
hei oct
hei nov
hei dec
elo
elo jan
elo feb
elo mar
elo apr
elo may
elo jun
elo jly
elo aug
elo sep
elo oct
elo nov
elo dec
syy
syy jan
syy feb
syy mar
syy apr
syy may
syy jun
syy jly
syy aug
syy sep
syy oct
syy nov
syy dec
lok
lok jan
lok feb
lok mar
lok apr
lok may
lok jun
lok jly
lok aug
lok sep
lok oct
lok nov
lok dec
mer
mer jan
mer feb
mer mar
mer apr
mer may
mer jun
mer jly
mer aug
mer sep
mer oct
mer nov
mer dec
jou
jou jan
jou feb
jou mar
jou apr
jou may
jou jun
jou jly
jou aug
jou sep
jou oct
jou nov
jou dec

题解2：特别傻的解法 Java

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;public class Main {// tret,jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, decstatic String geToMars(int ge) {switch (ge) {case 0:return "tret";case 1:return "jan";case 2:return "feb";case 3:return "mar";case 4:return "apr";case 5:return "may";case 6:return "jun";case 7:return "jly";case 8:return "aug";case 9:return "sep";case 10:return "oct";case 11:return "nov";case 12:return "dec";default:return "GeEXCEPTION!";}}// tret,tam, hel, maa, huh, tou, kes, hei, elo, syy, lok, mer, joustatic String shiToMars(int shi) {switch (shi) {case 0:return "";case 1:return "tam ";case 2:return "hel ";case 3:return "maa ";case 4:return "huh ";case 5:return "tou ";case 6:return "kes ";case 7:return "hei ";case 8:return "elo ";case 9:return "syy ";case 10:return "lok ";case 11:return "mer ";case 12:return "jou ";default:return "shiEXCEPTION!";}}// tret,jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, decstatic int marsToge(String ge) {switch (ge) {case "tret":return 0;case "jan":return 1;case "feb":return 2;case "mar":return 3;case "apr":return 4;case "may":return 5;case "jun":return 6;case "jly":return 7;case "aug":return 8;case "sep":return 9;case "oct":return 10;case "nov":return 11;case "dec":return 12;default:return -1;}}// tret,tam, hel, maa, huh, tou, kes, hei, elo, syy, lok, mer, joustatic int marsToshi(String ge) {switch (ge) {case "tret":return 0;case "tam":return 1;case "hel":return 2;case "maa":return 3;case "huh":return 4;case "tou":return 5;case "kes":return 6;case "hei":return 7;case "elo":return 8;case "syy":return 9;case "lok":return 10;case "mer":return 11;case "jou":return 12;default:return -2;}}// 地球转火星static String toMars(String str) {int num = Integer.parseInt(str);int ge = num % 13;// 个位int shi = num / 13;// 十位if (shi == 0) {return geToMars(ge);} else if (ge == 0) {return shiToMars(shi).trim();} else {return shiToMars(shi) + geToMars(ge);}}// 火星转地球static int toEarth(String str) {String[] arr = null;String shi;String ge;if (str.length() > 5) {arr = str.split(" ");shi = arr[0];ge = arr[1];return marsToshi(shi) * 13 + marsToge(ge);} else {ge = str;if (marsToge(ge) != -1) {return marsToge(ge);} else {return marsToshi(ge) * 13;}}}public static void main(String[] args) {Scanner sc = new Scanner(System.in);// 总数int total = Integer.parseInt(sc.nextLine());// 读取int cnt = 0;String[] nums = new String[500];for (int i = 0; i < total; i++) {String line = sc.nextLine();nums[cnt] = line;cnt++;}// 转化List<String> res = new ArrayList<>();for (int i = 0; i < total; i++) {if (nums[i].charAt(0) >= '0' && nums[i].charAt(0) <= '9') {// 第一个字符是数字还是字母res.add(toMars(nums[i]));} else {res.add(toEarth(nums[i]) + "");}}// 输出for (String s : res) {System.out.println(s);}}
}

【PAT甲级火星数字】1100 Mars Numbers (20 分)Java 全部AC相关推荐

PAT甲级1100 Mars Numbers (20 分)题解
\quad这个题稍微有点麻烦,需要分别处理数字转火星文和火星文转数字两种情况.不过数字最高两位,处理起来分别讨论即可.程序如下: #include <iostream> using nam ...
1100 Mars Numbers (20 分)【难度: 一般 / 知识点: 模拟】
https://pintia.cn/problem-sets/994805342720868352/problems/994805367156883456 乙级的原题.. #include<bi ...
1100 Mars Numbers (20分)
这类题目是C++标准模板库的使用,是重点知识. 题目描述如下: 题目大致意思与大致思路: 这道题目其实就是一道10进制与13进制之间的进制转换的题目,如果输入的是10进制,则将十进制转换为13进制,根 ...
【PAT甲级排序】1096 Consecutive Factors (20 分) C++ 全部AC
题目难倒是不难,暴力破解即可.要注意的就是开longlong,以及开方时,不要丢失临界值,还有如果子序列长度为0的话,输出num本身(因为计算的时候不考虑1这个因数). 一开始想出来一种O(n)的算 ...
【PAT甲级 LinkedHashMap】1041 Be Unique (20 分) Java、C++版
题目题目的意思是,找到第一个不重复的元素.输出它. 一开始用Java做,试了好多种方法都超时.后来换用C++通过了. AC题解:C++版用Java尝试了各种方式,都是后两个测试点过不去,只好换C+ ...
PAT_（STL使用）map-1100 Mars Numbers (20分)-1054 The Dominant Color (20分)-1071-1022
目录 1100 Mars Numbers (20分) 1054 The Dominant Color (20分) 1071 Speech Patterns (25分) 1022 Digital Lib ...
PAT 1100. Mars Numbers (20)
People on Mars count their numbers with base 13: Zero on Earth is called "tret" on Mars. T ...
PAT甲级题解-1100. Mars Numbers (20)-字符串处理
没什么好说的,注意字符串的处理,以及当数字是13的倍数时,只需高位叫法的单词.比如26,是"hel",而不是"hel tret". 代码: #include & ...
【PAT甲级前导0，排序】1069 The Black Hole of Numbers (20 分) C++ 全部AC
题目一直循环相减即可,直到结果为6174或者四个数字相同就结束循环题解 C++ #include<iostream> #include<stdio.h> #include& ...

【PAT甲级火星数字】1100 Mars Numbers (20 分)Java 全部AC

题目

题解1：Java

题解2：特别傻的解法 Java

【PAT甲级火星数字】1100 Mars Numbers (20 分)Java 全部AC相关推荐

最新文章

热门文章

【PAT甲级 火星数字】1100 Mars Numbers (20 分)Java 全部AC

题目

题解1：Java

题解2：特别傻的解法 Java

【PAT甲级 火星数字】1100 Mars Numbers (20 分)Java 全部AC相关推荐

最新文章

热门文章

【PAT甲级火星数字】1100 Mars Numbers (20 分)Java 全部AC

【PAT甲级火星数字】1100 Mars Numbers (20 分)Java 全部AC相关推荐