COMP 248 Lecture 1: Sentence.java

• School: Concordia University
• Department: Computer Sci.
• Course: COMP 248
• Professor: Leila Kosseim

Document Summary

* assignment #2 - question 1 - one possible solution. // let"s initialize the various lenghts maxlen=0; minlen=sentence. length(); curlen=0; sumwordlen=0; System. out. println("\n\nhere are some stats on your sentence: \n"); System. out. println("word " + (nbwords+1) + " has " + curlen + " characters. // check if it is the longest or shortest word so far if (curlen > maxlen) maxlen = curlen; if (curlen < minlen) minlen = curlen; // increase the the sum of all lengths to compute the average later sumwordlen += curlen; // reset the lenght of the current word to zero for the next word to come curlen = 0; else // we are still "inside" a word curlen++; // count one more character in the word. // once all characters have been processed, let"s display the results. System. out. println("\nthere are " + nbwords + " words. System. out. println("the longest word has " + maxlen + " characters. System. out. println("the shortest word has " + minlen + " characters.