FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_02/id_108/LeetCode_242_108.java at master · isnotnull/algorithm · GitHub
isnotnull
/
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_02
/
id_108
/
LeetCode_242_108.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
66 lines (59 loc) · 1.86 KB
Breadcrumbs
algorithm
/
Week_02
/
id_108
/
LeetCode_242_108.java
Copy path
File metadata and controls
66 lines (59 loc) · 1.86 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
import
java
.
util
.
HashMap
;
/**
* @author zhangruihao.zhang
* @version v1.0.0
* @since 2019/04/28
*/
public
class
LeetCode_242_108
{
class
Solution1
{
public
boolean
isAnagram
(
String
s
,
String
t
) {
if
(
s
==
null
||
t
==
null
||
s
.
length
() !=
t
.
length
()){
return
false
;
}
HashMap
<
Character
,
Integer
>
source
=
new
HashMap
<
Character
,
Integer
>();
HashMap
<
Character
,
Integer
>
target
=
new
HashMap
<
Character
,
Integer
>();
Integer
count
=
null
;
Character
c
=
null
;
for
(
int
i
=
0
;
i
<
s
.
length
() ;
i
++){
c
=
s
.
charAt
(
i
);
if
(
source
.
containsKey
(
c
)){
count
=
source
.
get
(
c
);
source
.
put
(
c
,
count
+
1
);
}
else
{
source
.
put
(
c
,
1
);
}
}
for
(
int
i
=
0
;
i
<
t
.
length
() ;
i
++){
c
=
t
.
charAt
(
i
);
if
(
source
.
containsKey
(
c
) &&
source
.
get
(
c
) >
0
){
count
=
source
.
get
(
c
);
source
.
put
(
c
,
count
-
1
);
}
else
{
target
.
put
(
c
,
1
);
}
}
return
target
.
keySet
().
size
() ==
0
;
}
}
class
Solution2
{
public
boolean
isAnagram
(
String
s
,
String
t
) {
if
(
s
==
null
||
t
==
null
||
s
.
length
() !=
t
.
length
()){
return
false
;
}
if
(
s
.
equals
(
""
) &&
t
.
equals
(
""
)){
return
true
;
}
int
[]
arr
=
new
int
[
26
];
for
(
int
i
=
0
;
i
<
s
.
length
() ;
i
++){
arr
[
s
.
charAt
(
i
) -
'a'
] ++;
arr
[
t
.
charAt
(
i
) -
'a'
] --;
}
for
(
int
i
=
0
;
i
<
arr
.
length
;
i
++){
if
(
arr
[
i
] !=
0
){
return
false
;
}
}
return
true
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL