Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update TopKWords.java

Browse Source 
All has been improved according to your advice.
This commit is contained in:
Keqi Huang 2018-04-08 17:04:17 -05:00 committed by GitHub
parent df1b68b9ee
commit 68d945077e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 59 additions and 67 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

88
Others/TopKWords.java
View File

@ -5,33 +5,7 @@ import java.util.*;
in the file – shown in order (ignore case and periods) */
public class TopKWords {
public static void main(String[] a) {
// you can replace the filePath with yours
CountWords cw = new CountWords("/Users/lisanaaa/Desktop/words.txt");
Map<String, Integer> dictionary = cw.getDictionary(); // get the words dictionary: {word: frequency}
// we change the map to list for convenient sort
List<Map.Entry<String, Integer>> list = new ArrayList<>(dictionary.entrySet());
// sort by lambda valueComparator
list.sort(Comparator.comparing(
m -> m.getValue())
);
Scanner input = new Scanner(System.in);
Integer k = new Integer(input.nextLine());
while (k > list.size()) {
System.out.println("Retype a number, your number is too large");
input = new Scanner(System.in);
k = new Integer(input.nextLine());
}
for (int i = 0; i<k; i++) {
System.out.println(list.get(list.size()-i-1));
}
}
}
class CountWords {
static class CountWords {
private String fileName;
public CountWords(String fileName) {
@ -46,47 +20,65 @@ class CountWords {
fis = new FileInputStream(fileName); // open the file
int in = 0;
StringBuffer sb = new StringBuffer(); // load the word
String s = new String(); // init a empty word
in = fis.read(); // read one character
boolean notEnd = true; // signal whether is the end of file
while (notEnd) {
// when in == -1 means get the end of the file
if (-1 == in) {
notEnd = false; //if false, end the while loop
}
while (-1 != in) {
if (Character.isLetter((char)in)) {
sb.append((char)in); //if get a letter, put it in StringBuffer
s += (char)in; //if get a letter, append to s
} else {
// this branch means an entire word has just been read
if (sb.length() > 0) {
//see whether word exists in StringBuffer or not
if (dictionary.containsKey(sb.toString())) {
if (s.length() > 0) {
// see whether word exists or not
if (dictionary.containsKey(s)) {
// if exist, count++
dictionary.put(sb.toString(), dictionary.get(sb.toString()) + 1);
dictionary.put(s, dictionary.get(s) + 1);
} else {
// if not exist, initiate count of this word with 1
dictionary.put(sb.toString(), 1);
dictionary.put(s, 1);
}
}
sb = new StringBuffer(); //reload the StringBuffer
s = ""; // reInit a empty word
}
in = fis.read(); //read the character
in = fis.read();
}
return dictionary;
}
catch (IOException e) {
} catch (IOException e) {
e.printStackTrace();
}
finally {
} finally {
try {
// you always have to close the I/O streams
fis.close();
}
catch (IOException e) {
} catch (IOException e) {
e.printStackTrace();
}
}
return null;
}
}
public static void main(String[] args) {
// you can replace the filePath with yours
CountWords cw = new CountWords("/Users/lisanaaa/Desktop/words.txt");
Map<String, Integer> dictionary = cw.getDictionary(); // get the words dictionary: {word: frequency}
// we change the map to list for convenient sort
List<Map.Entry<String, Integer>> list = new ArrayList<>(dictionary.entrySet());
// sort by lambda valueComparator
list.sort(Comparator.comparing(
m -> m.getValue())
);
Scanner input = new Scanner(System.in);
int k = input.nextInt();
while (k > list.size()) {
System.out.println("Retype a number, your number is too large");
input = new Scanner(System.in);
k = new Integer(input.nextLine());
}
for (int i = 0; i < k; i++) {
System.out.println(list.get(list.size() - i - 1));
}
}
}