Concept explainers
Explanation of Solution
Method “wordLengths()” to print the “*” for the words containing each number of letters.
//Import required packages
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.Scanner;
//Definition of class Test
public class Test
{
//Definition of main class
public static void main(String[] args) throws FileNotFoundException
{
//Open the file
Scanner input=new Scanner(new FileReader("input.txt"));
//Call the method transpose
wordLengths(input);
}
//Definition of method wordLengths
public static void wordLengths(Scanner infile)
throws FileNotFoundException
{
//Create an array
int[] arr = new int[100];
int size = 0;
String tok;
//While loop to retrieve the words from the file
while(infile.hasNext())
{
//Store the words in the variable "tok"
tok = infile.next();
//Increment the array size
arr[tok.length()]++;
//Check whether the length is greater than size
if(tok.length() > size)
//Assign length to the size
size = tok...
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Building Java Programs: A Back To Basics Approach, Loose Leaf Edition (5th Edition)
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education