Question
HELP IN JAVA: This exercise uses the Java LinkedList class. Using the input file words_no_duplicates.txt, input each string putting it into a different LinkedList depending
HELP IN JAVA:
This exercise uses the Java LinkedList class.
Using the input file words_no_duplicates.txt, input each string putting it into a different LinkedList depending on the first character in the String. (Yes, you will need 26 linked lists).
Then prompt the user for a (lower case) character and display all the words beginning with that character. (If the user enters an invalid character, trap them in a loop until they give you a valid one).
Note: nothing is sorted.
words_no_duplicates.txt:
noncollectable
reallocation
drenching
obnoxious
venality
dybbuk
shotgun
changelessly
handiwork
unheralded
dovecote
anode
spellbind
psychologist
improvisational
prejudiced
What I have so far:
public class H {
public static void main(String[] args) { //LinkedList Strings A-Z /*LinkedList
//else { System.out.print("Word starts with entered character not found."); } } }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started