Skip to content

finished #22

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 6 commits 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
59 changes: 59 additions & 0 deletions src/main/java/io/zipcoder/ParenChecker.java
Original file line number Diff line number Diff line change
@@ -1,4 +1,63 @@
package io.zipcoder;

import java.util.ArrayList;
import java.util.EnumSet;
import java.util.Stack;

public class ParenChecker {

public Stack<String> punctuationPairs;
EnumSet<SpecialCharactersEnum> pairs = EnumSet.allOf(SpecialCharactersEnum.class);


ParenChecker(){
this.punctuationPairs = new Stack<>();
}

ParenChecker(Stack<String> punctuationPairs){
this.punctuationPairs = punctuationPairs;
}

public Stack getPunctuationPairs() {
return punctuationPairs;
}

public boolean parenCheck(){

boolean paired = false;
int begin = punctuationPairs.search(SpecialCharactersEnum.PARENTHESIS.getBeginChar());
int end = punctuationPairs.search(SpecialCharactersEnum.PARENTHESIS.getEndChar());
if(end<begin && begin>0 && end>0) paired = true;
return paired;
}

public boolean surround() {
boolean paired = true;
ArrayList<Integer> beginChar = new ArrayList<>();
ArrayList<Integer> endChar = new ArrayList<>();
for (SpecialCharactersEnum character : pairs) {
Integer begin = punctuationPairs.indexOf(character.getBeginChar());
Integer end = punctuationPairs.indexOf(character.getEndChar());
while (begin >= 0) {
beginChar.add(begin);
begin = punctuationPairs.indexOf(character.getBeginChar(), begin + 1);
}
while (end >= 0) {
endChar.add(end);
end = punctuationPairs.indexOf(character.getEndChar(), end + 1);
}
if (endChar.size() == 0 || beginChar.size()==0) {
return false;
}
if (endChar.size() > 0 && beginChar.size()>0) {
if (endChar.get(endChar.size() - 1) < beginChar.get(endChar.size() - 1)) {
return false;
}
if (beginChar.size() != endChar.size()) {
return false;
}
}
}
return paired;
}
}
36 changes: 36 additions & 0 deletions src/main/java/io/zipcoder/SpecialCharactersEnum.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
package io.zipcoder;

public enum SpecialCharactersEnum {
PARENTHESIS("(", ")"),
CURLY_BRACES("{", "}"),
SQUARE_BRACKETS("[","]"),
CHEVRONS("<", ">"),
SINGLE_QUOTES("\'", "\'"),
DOUBLE_QUOTES("\"", "\"");

private final String beginChar;
private final String endChar;

SpecialCharactersEnum(String beginChar, String endChar){
this.beginChar = beginChar;
this.endChar = endChar;
}

public String getBeginChar(){
return beginChar;
}

public String getEndChar(){
return endChar;
}

public String getOppositeChar(String str){
String opposite = "";
if(str.equals(beginChar)) opposite = endChar;
if(str.equals(endChar)) opposite = beginChar;
return opposite;
}



}
37 changes: 35 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,16 @@

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.Iterator;
import java.util.Scanner;
import java.util.*;
import java.util.stream.Collectors;
import java.util.stream.Stream;

import static java.math.BigInteger.valueOf;

public class WC {

private Iterator<String> si;
private HashMap<String, Integer> wordCount;

public WC(String fileName) {
try {
Expand All @@ -15,9 +20,37 @@ public WC(String fileName) {
System.out.println(fileName + " Does Not Exist");
System.exit(-1);
}
this.wordCount = new HashMap<>();
}

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

public void createMap() {
while (si.hasNext()) {
si.hasNext();
String input = si.next();
String element = input.replaceAll("\\W+", "").toLowerCase();
if(!wordCount.containsKey(element)) {
wordCount.put(element, 1);
} else if(wordCount.containsKey(element)) {
wordCount.replace(element, wordCount.get(element)+1);
}
}
}


public StringBuilder printMap(){
StringBuilder count = new StringBuilder();
ArrayList<Map.Entry<String,Integer>> list = new ArrayList<>(wordCount.entrySet());
list.sort(Comparator.comparing(Map.Entry::getValue));
Collections.reverse(list);
for(Map.Entry<String,Integer> entry: list){
count.append(entry.getKey()).append(": ").append(entry.getValue()).append("\n");
}
return count;
}

}

Loading