FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_03/id_135/LeetCode_997_135.java at master · feixiangcode/algorithm · GitHub
feixiangcode
/
algorithm
Public
forked from
algorithm001/algorithm
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
algorithm
/
Week_03
/
id_135
/
LeetCode_997_135.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
27 lines (24 loc) · 712 Bytes
Breadcrumbs
algorithm
/
Week_03
/
id_135
/
LeetCode_997_135.java
Copy path
File metadata and controls
27 lines (24 loc) · 712 Bytes
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
class
Solution
{
public
int
findJudge
(
int
N
,
int
[][]
trust
) {
if
(
N
==
1
){
return
N
;
}
HashMap
<
Integer
,
Integer
>
hashMap
=
new
HashMap
(
trust
.
length
);
int
[]
ints
=
new
int
[
trust
.
length
];
for
(
int
i
=
0
;
i
<
trust
.
length
;
i
++){
ints
[
i
] =
trust
[
i
][
0
];
hashMap
.
put
(
trust
[
i
][
1
],
hashMap
.
getOrDefault
(
trust
[
i
][
1
],
0
)+
1
);
}
for
(
Integer
key
:
hashMap
.
keySet
()){
if
(
hashMap
.
get
(
key
) ==
N
-
1
){
for
(
Integer
s
:
ints
){
if
(
s
.
equals
(
key
)){
return
-
1
;
}
}
return
key
;
}
}
return
-
1
;
}
}
Back
|
FazBrowse Home
|
New Git URL