FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/Others/TopKWords.java at dev · primary-code-test/Java · GitHub
primary-code-test
Java
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
Others
/
TopKWords.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
86 lines (74 loc) · 2.52 KB
Breadcrumbs
Java
/
Others
/
TopKWords.java
Copy path
File metadata and controls
86 lines (74 loc) · 2.52 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
package
Others
;
import
java
.
io
.*;
import
java
.
util
.*;
/* display the most frequent K words in the file and the times it appear
in the file – shown in order (ignore case and periods) */
public
class
TopKWords
{
static
class
CountWords
{
private
String
fileName
;
public
CountWords
(
String
fileName
) {
this
.
fileName
=
fileName
;
}
public
Map
<
String
,
Integer
>
getDictionary
() {
Map
<
String
,
Integer
>
dictionary
=
new
HashMap
<>();
FileInputStream
fis
=
null
;
try
{
fis
=
new
FileInputStream
(
fileName
);
// open the file
int
in
=
0
;
String
s
=
""
;
// init a empty word
in
=
fis
.
read
();
// read one character
while
(-
1
!=
in
) {
if
(
Character
.
isLetter
((
char
)
in
)) {
s
+= (
char
)
in
;
// if get a letter, append to s
}
else
{
// this branch means an entire word has just been read
if
(
s
.
length
() >
0
) {
// see whether word exists or not
if
(
dictionary
.
containsKey
(
s
)) {
// if exist, count++
dictionary
.
put
(
s
,
dictionary
.
get
(
s
) +
1
);
}
else
{
// if not exist, initiate count of this word with 1
dictionary
.
put
(
s
,
1
);
}
}
s
=
""
;
// reInit a empty word
}
in
=
fis
.
read
();
}
return
dictionary
;
}
catch
(
IOException
e
) {
e
.
printStackTrace
();
}
finally
{
try
{
// you always have to close the I/O streams
if
(
fis
!=
null
)
fis
.
close
();
}
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
=
input
.
nextInt
();
}
for
(
int
i
=
0
;
i
<
k
;
i
++) {
System
.
out
.
println
(
list
.
get
(
list
.
size
() -
i
-
1
));
}
input
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL