解题思路:看到键和值,第一时间想的是键值对,较复杂
注意事项:
参考代码:
import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class 报时小助手 { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub Map<Integer, String> map=new HashMap<Integer, String>(); map.put(0,"zero"); map.put(1,"one"); map.put(2,"two"); map.put(3,"three"); map.put(4,"four"); map.put(5,"five"); map.put(6,"six"); map.put(7,"seven"); map.put(8,"eight"); map.put(9,"nine"); map.put(10,"ten"); map.put(11,"eleven"); map.put(12,"twelve"); map.put(13,"thirteen"); map.put(14,"fourteen"); map.put(15,"fifteen"); map.put(16,"sixteen"); map.put(17,"seventeen"); map.put(18,"eighteen"); map.put(19,"nineteen"); map.put(20,"twenty"); map.put(30,"thirty"); map.put(40,"forty"); map.put(50,"fifty"); Scanner scanner=new Scanner(System.in); int m=scanner.nextInt(); int f=scanner.nextInt(); if (m<=20) { System.out.print(map.get(m)+" "); } else if(m<30){ System.out.print(map.get(20)+" "+map.get(m-20)+" "); } if (f==0) { System.out.print("o'clock"); } else if (f<=20) { System.out.print(map.get(f)); } else if(f<=30){ if (f==30) { System.out.println(map.get(30)); } else { System.out.print(map.get(20)+" "+map.get(f-20)); } } else if(f<=40){ if (f==40) { System.out.println(map.get(40)); } else { System.out.print(map.get(30)+" "+map.get(f-30)); } } else if(f<=50){ if (f==50) { System.out.println(map.get(50)); } else { System.out.print(map.get(40)+" "+map.get(f-40)); } } else { System.out.print(map.get(50)+" "+map.get(f-50)); } } }
0.0分
0 人评分
C语言训练-自由落体问题 (C语言代码)浏览:1738 |
不容易系列 (C语言代码)浏览:668 |
【矩阵】 (C++代码)浏览:949 |
C语言程序设计教程(第三版)课后习题1.6 (C语言代码)浏览:545 |
DNA (C语言代码)浏览:749 |
2003年秋浙江省计算机等级考试二级C 编程题(1) (C语言代码)浏览:683 |
杨辉三角 (C语言代码)浏览:484 |
演讲大赛评分 (C语言代码)浏览:1636 |
企业奖金发放 (C语言代码)浏览:2325 |
输出九九乘法表 (C语言代码)浏览:1048 |