-
Notifications
You must be signed in to change notification settings - Fork 0
/
Anagrams.java
56 lines (53 loc) · 1.4 KB
/
Anagrams.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package anagrams;
import java.io.*;
public class Anagrams{
public static void main(String []args){
//pull file from args
File dict = null;
if(args.length > 0){
dict = new File(args[0]);
}
//set up hash table
HashTable hashTable = new HashTable();
//start reading file
try(BufferedReader br = new BufferedReader(new FileReader(dict))){
String textLine = br.readLine();
while(textLine != null){
//hash words as they are read
hashTable.addToTable(hashTable.hashFunction(textLine));
textLine = br.readLine();
}
br.close();
//done reading
//start writing
//cycle through all lists in hash table
//at each list, cycle through all classes
//toString all classes in list
PrintWriter pw = new PrintWriter(new FileWriter("anagram.txt"));
int a=0;
LinkedList[] ht = hashTable.getHashTable();
for(int i=0; i<10000;i++){
if(ht[i] != null){
LinkedList LList = ht[i];
LLNode curr = LList.getFirst();
while(curr.getNext() != null){
String s = curr.getAnagram().ClassToString();
a++;
if(s != ""){
pw.println(s);
}
curr = curr.getNext();
}
}
}
pw.close();
System.out.println(a);
}
catch(Exception e){
e.printStackTrace();
}//hash words as they are read
}
}
//CommandLine commands for running dict1 and dict2:
//java -cp . anagrams.Anagrams dict1
//java -Xmx1024m -cp . anagrams.Anagrams dict2