JAVA PROGRAM ASAP Please give me a new program ASAP BECAUSE the program down below does not pass all the test cases when I upload it to hypergrade. The program must pass the test case when uploaded to Hypergrade. I have provided the failed test cases as a screenshot. import java.util.HashMap; import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.Scanner; public class MorseCodeConverter { private static HashMap morseMap = new HashMap<>(); public static void main(String[] args) { loadMorseCodes(); Scanner scanner = new Scanner(System.in); System.out.println("Please enter a string to convert to Morse code:"); String input = scanner.nextLine().toUpperCase(); String morseCode = convertToMorse(input); System.out.println(morseCode); } private static void loadMorseCodes() { try (BufferedReader reader = new BufferedReader(new FileReader("morse.txt"))) { String line; while ((line = reader.readLine()) != null) { char key = line.charAt(0); String value = line.substring(4); morseMap.put(key, value); } } catch (IOException e) { e.printStackTrace(); } } private static String convertToMorse(String input) { StringBuilder morseCode = new StringBuilder(); int count = 0; for (char ch : input.toCharArray()) { if (ch == ' ') { morseCode.append(" "); continue; } String code = morseMap.get(ch); if (code != null) { morseCode.append(code); morseCode.append(' '); count++; if (count == 8) { morseCode.append('\n'); count = 0; } } } return morseCode.toString().trim(); } } Morse.txt 0 ----- 1 .---- 2 ..--- 3 ...-- 4 ....- 5 ..... 6 -.... 7 --... 8 ---.. 9 ----. , --..-- . .-.-.- ? ..--.. A .- B -... C -.-. D -.. E . F ..-. G --. H .... I .. J .--- K -.- L .-.. M -- N -. O --- P .--. Q --.- R .-. S ... T - U ..- V ...- W .-- X -..- Y -.-- Z --.. Test Case 1 Please enter a string to convert to Morse code:\n ENTER \n Test Case 2 Please enter a string to convert to Morse code:\n abcENTER .- -... -.-. \n Test Case 3 Please enter a string to convert to Morse code:\n This is a sample string 1234.ENTER - .... .. ... .. ... .- ... .- -- .--. .-.. . ... - .-. .. -. --. .---- ..--- ...-- ....- .-.-.- \n
JAVA PROGRAM ASAP
Please give me a new program ASAP BECAUSE the program down below does not pass all the test cases when I upload it to hypergrade. The program must pass the test case when uploaded to Hypergrade. I have provided the failed test cases as a screenshot.
import java.util.HashMap;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.Scanner;
public class MorseCodeConverter {
private static HashMap<Character, String> morseMap = new HashMap<>();
public static void main(String[] args) {
loadMorseCodes();
Scanner scanner = new Scanner(System.in);
System.out.println("Please enter a string to convert to Morse code:");
String input = scanner.nextLine().toUpperCase();
String morseCode = convertToMorse(input);
System.out.println(morseCode);
}
private static void loadMorseCodes() {
try (BufferedReader reader = new BufferedReader(new FileReader("morse.txt"))) {
String line;
while ((line = reader.readLine()) != null) {
char key = line.charAt(0);
String value = line.substring(4);
morseMap.put(key, value);
}
} catch (IOException e) {
e.printStackTrace();
}
}
private static String convertToMorse(String input) {
StringBuilder morseCode = new StringBuilder();
int count = 0;
for (char ch : input.toCharArray()) {
if (ch == ' ') {
morseCode.append(" ");
continue;
}
String code = morseMap.get(ch);
if (code != null) {
morseCode.append(code);
morseCode.append(' ');
count++;
if (count == 8) {
morseCode.append('\n');
count = 0;
}
}
}
return morseCode.toString().trim();
}
}
0 -----
1 .----
2 ..---
3 ...--
4 ....-
5 .....
6 -....
7 --...
8 ---..
9 ----.
, --..--
. .-.-.-
? ..--..
A .-
B -...
C -.-.
D -..
E .
F ..-.
G --.
H ....
I ..
J .---
K -.-
L .-..
M --
N -.
O ---
P .--.
Q --.-
R .-.
S ...
T -
U ..-
V ...-
W .--
X -..-
Y -.--
Z --..
Test Case 1
ENTER
\n
Test Case 2
abcENTER
.- -... -.-. \n
Test Case 3
This is a sample string 1234.ENTER
- .... .. ... .. ... .- ... .- -- .--. .-.. . ... - .-. .. -. --. .---- ..--- ...-- ....- .-.-.- \n
Step by step
Solved in 4 steps with 5 images
