![]() ![]() (It should be 72875.) You could also use the contains method to check for the presence of some common word in the set. To make sure that you've read all the words, check the size of the set. For the purposes of this program, convert all words to lower case before putting them in the set. Start your main program by reading the words from words.txt and storing them in a HashSet. (For the wordlist file, a token is simply a word.) Process(tk) // do something with the token (new File("/classes/s09/cs225/words.txt")) Īnd that a file can be processed, token by token, in a loop such as: ![]() You can create scanner, filein, for reading from a file with a statement such as: Since there is no need to have the words stored in order, you can use a HashSet for maximum efficiency. To make the list easy to use, you can store the words in a set. ![]() You will look up words in this list to check whether they are correctly spelled. THE BRAVE LITTLE TOASTER GOES TO MARS I RAN OUTTA JUICE CODEThe file words.txt (in the code directory) contains a list of English words, with one word on each line. You will also need to be able to traverse a set, using either an iterator or a for-each loop.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |