Skip to content

done, had to start over #30

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions pom.xml
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,18 @@
<groupId>io.zipcoder</groupId>
<artifactId>collections</artifactId>
<version>1.0-SNAPSHOT</version>
<build>
<plugins>
<plugin>
<groupId>org.apache.maven.plugins</groupId>
<artifactId>maven-compiler-plugin</artifactId>
<configuration>
<source>1.8</source>
<target>1.8</target>
</configuration>
</plugin>
</plugins>
</build>

<dependencies>
<dependency>
Expand Down
65 changes: 64 additions & 1 deletion src/main/java/io/zipcoder/ParenChecker.java
Original file line number Diff line number Diff line change
@@ -1,4 +1,67 @@
package io.zipcoder;

public class ParenChecker {
import java.util.Stack;

public class ParenChecker
{
public boolean containsPair(String inputString, Character openChar, Character closeChar)
{
Stack<Character> characterStack = new Stack<Character>();

for(int i = 0; i < inputString.length(); i++)
{
char currentChar = inputString.charAt(i);

if(currentChar == openChar)
{
characterStack.push(currentChar);
continue;
}

if (currentChar == closeChar)
{
if(characterStack.isEmpty())
{
return false;
}

else if(characterStack.peek() == openChar)
{
characterStack.push(closeChar);
}


}


}

return characterStack.empty() || (characterStack.size() % 2 == 0);
}

public boolean parenPair(String inputString)
{
if (containsPair(inputString, '(', ')'))
{ return true;}

return false;
}

public boolean anyPair(String inputString)
{
if (containsPair(inputString, '(', ')')&&
(containsPair(inputString, '<', '>')) &&
(containsPair(inputString, '[', ']'))&&
(containsPair(inputString, '{', '}'))&&
(containsPair(inputString, '\'', '\''))&&
(containsPair(inputString, '\"', '\"')))
{
return true;
}

return false;
}



}
36 changes: 34 additions & 2 deletions src/main/java/io/zipcoder/WC.java
Original file line number Diff line number Diff line change
Expand Up @@ -2,11 +2,11 @@

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.Iterator;
import java.util.Scanner;
import java.util.*;

public class WC {
private Iterator<String> si;
private LinkedHashMap<String, Integer> countWords;

public WC(String fileName) {
try {
Expand All @@ -15,9 +15,41 @@ public WC(String fileName) {
System.out.println(fileName + " Does Not Exist");
System.exit(-1);
}

this.countWords = new LinkedHashMap<String, Integer>();
}


public WC(Iterator<String> si) {
this.si = si;
}

public void generateLinkedHashMap()
{
while (si.hasNext())
{
String nextWord = si.next().toLowerCase();

if(!countWords.containsKey(nextWord))
{
countWords.put(nextWord, 1);
}
else countWords.put(nextWord, countWords.get(nextWord) +1);
}
}

public StringBuilder printLinkedHashMap()
{
StringBuilder sbCount = new StringBuilder();
List<Map.Entry<String,Integer>> list = new ArrayList<>(countWords.entrySet());
list.sort(Comparator.comparing(Map.Entry::getValue));
Collections.reverse(list);

for (Map.Entry<String, Integer> entry : list)
{
sbCount.append(entry.getKey()).append(": ").append(entry.getValue()).append("\n");
}

return sbCount;
}
}
Loading