thulasi 2e35c37228 completed the Encapsulative Charecters | 6 년 전 | |
---|---|---|
src | 6 년 전 | |
.DS_Store | 6 년 전 | |
.gitignore | 7 년 전 | |
README.md | 7 년 전 | |
pom.xml | 7 년 전 |
Create a class with a method that verifies all parens ()
are paired.
HINT: Use a stack.
Now create a method that checks that all opening characters have a closing one.
Characters include ()
{}
[]
<>
""
''
Write a program that counts all of the words in a file and prints out all of the words and their counts in descending order.
You can put an text file in resources and get that string's filename from
WC.class.getResource("/filename").getFile()
I would suggest grabbing a book from gutenberg.org
and use that as a testing set.
Also, there is a String iterator constructor so that you can also write some tests using some data built within the tests.