JAVA算法提高 9-3摩尔斯电码

最新推荐文章于 2022-04-25 14:08:47 发布

许你一世丶安然

最新推荐文章于 2022-04-25 14:08:47 发布

阅读量436

点赞数

分类专栏： JAVA

本文链接：https://blog.youkuaiyun.com/qq_24435185/article/details/79778685

版权

JAVA 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个使用Java编写的简单程序，该程序能够将输入的摩尔斯电码字符串转换为对应的字母。通过解析特定格式的电码，程序实现了不同字符的识别，并将其转化为小写字母形式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

import java.util.Scanner;

public class Main {

public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String st = in.nextLine();
String st1 = "", st2 = "";

for (int i = 0; i <=st.length(); i++) {
// ||i==st.length()
if (i==st.length()||st.substring(i, i + 1).equals("|")) {
switch (st1) {
case "*-":
st2 = st2 + "A";
break;
case "*":
st2 = st2 + "E";
break;
case "**":
st2 = st2 + "I";
break;
case "--":
st2 = st2 + "M";
break;
case "--*-":
st2 = st2 + "Q";
break;
case "**-":
st2 = st2 + "U";
break;
case "-*--":
st2 = st2 + "Y";
break;
case "-***":
st2 = st2 + "B";
break;
case "**-*":
st2 = st2 + "F";
break;
case "*---":
st2 = st2 + "J";
break;
case "-*":
st2 = st2 + "N";
break;
case "*-*":
st2 = st2 + "R";
break;
case "***-":
st2 = st2 + "V";
break;
case "--**":
st2 = st2 + "Z";
break;
case "-*-*":
st2 = st2 + "C";
break;
case "--*":
st2 = st2 + "G";
break;
case "-*-":
st2 = st2 + "K";
break;

case "---":
st2 = st2 + "O";
break;

case "***":
st2 = st2 + "S";
break;
case "*--":
st2 = st2 + "W";
break;
case "-**":
st2 = st2 + "D";
break;
case "****":
st2 = st2 + "H";
break;
case "*-**":
st2 = st2 + "L";
break;
case "*--*":
st2 = st2 + "P";
break;
case "-":
st2 = st2 + "T";
break;
case "-**-":
st2 = st2 + "X";
break;
default:
break;
}
st1="";
} else {
st1 = st1 + st.substring(i, i + 1);
}
}
System.out.println(st2.toLowerCase());
}
}