Zach Marcin fe5f30d7ee Built the groundwork for the lab | 7 anos atrás | |
---|---|---|
src | 7 anos atrás | |
.gitignore | 7 anos atrás | |
README.md | 7 anos atrás | |
pom.xml | 7 anos atrás |
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.