Any insight would be greatly appreciated.

Question about the task

Under discussion

My code won't pass the last two requirements, please have a look at my code and let me know if you have any suggestions. Thanks!!

In the main method, read the name of a file that contains words separated by spaces from the console.
In the getLine method, use StringBuilder to order all the words as follows: the last letter of a word must match the first letter of the next word (ignore case).
Each word should be used once.
The getLine method can return any variant.
Separate words with a space.
Display the resulting string on the screen.

Example input file:

Okinawa Washington Auckland Kalamazoo Norfolk

Result:

Washington Norfolk Kalamazoo Okinawa Auckland

Requirements:

The main method must read the filename from the keyboard.
There should not be static fields in the Solution class.
The getLine method must use StringBuilder.
The getLine method must return an empty string (an empty StringBuilder) if it is not passed arguments (words).
The getLine method must not change the arguments (words).
All words passed to the getLine method must be included in the resulting string, if possible.
The screen output must match the task conditions.

package com.codegym.task.task22.task2209; /* Make a word chain */ import java.io.*; import java.util.List; import java.util.ArrayList; import java.util.Arrays; import java.util.LinkedList; import java.util.Queue; public class Solution { public static void main(String[] args) { String[] arr; String fileName; try { BufferedReader reader = new BufferedReader(new InputStreamReader(System.in)); fileName = reader.readLine(); reader.close(); FileReader fileReader = new FileReader(fileName); BufferedReader br = new BufferedReader(fileReader); StringBuilder sb = new StringBuilder(); String line = br.readLine(); while (line != null) { sb.append(line + " "); line = br.readLine(); } arr = sb.toString().split(" "); StringBuilder result = getLine(arr); System.out.println(result.toString()); } catch (Exception e) { e.printStackTrace(); System.out.println("There's an error!"); } } public static StringBuilder getLine(String... words) { Queue<Word> wordList = new LinkedList<>(); StringBuilder sb2 = new StringBuilder(); if (words.length == 0 || words == null) { return sb2; } else { for (String a: words) { wordList.add(new Word(a)); } } Word getWord = wordList.poll(); //get the first word from the wordList and add to sb2 sb2.append(getWord.theWord); Word getNextWord = wordList.poll(); // ge the next word and compare to getWord. while((!getNextWord.seenTwice)) { String compare = sb2.toString(); String compareFirstLetter = Character.toString(compare.toCharArray()[0]); String compareLastLetter = Character.toString(compare.toCharArray()[compare.length() - 1]); String getNextWordFirstLetter = getNextWord.firstLetter; String getNextWordLastLetter = getNextWord.lastLetter; //need to know at what position to add the word into the StringBuilder, is it at the beginning or the end? if (compareLastLetter.equalsIgnoreCase(getNextWordFirstLetter)) { sb2.append(" " + getNextWord.theWord); } else if (compareFirstLetter.equalsIgnoreCase(getNextWordLastLetter)) { sb2.insert(0, getNextWord.theWord + " "); } else { if (getNextWord.seen == true) { getNextWord.seenTwice = true; } else { getNextWord.seen = true; } wordList.add(getNextWord); } if (wordList.isEmpty()) { break; } else { getNextWord = wordList.poll(); } } return sb2; } }

Comments (1)

Popular
New
Old

You must be signed in to leave a comment

Guadalupe Gagnon

Level 37 , Tampa, United States

8 June 2022, 15:29

This task has caused a lot of problems solving, mostly due to the ambiguous task conditions. I can share with you the difference between the code that I passed this task with and the code you have above: My code will return a valid chain of 2 or more words as long as at least 2 words in the input can be chained together. This is because it checks the leading word and when that word can't be chained to any other it will skip it and move to the next until it finds one where a chain can start. Only when no possible chain(s) can be formed from any of the given words will it return one of them. The above code starts the chain from the first word, and if no word can chain to that word then it just returns it. For example, if the file contained: People Okinawa Washington Auckland Kalamazoo Norfolk My code returns "Washington Norfolk Kalamazoo Okinawa Auckland", however the above code just returns "People". If the word People existed in any other location in the file instead of the first word then the above code will return the same as my code. I can't tell you if this will make your code pass or not, but it is a difference between our respective codes. I have heard from other people that have passed that they solved it completely different than I did, so I can't tell you 100% what will work and what will not.