FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_01/id_104/LeetCode_242_104.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_01
/
id_104
/
LeetCode_242_104.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
31 lines (28 loc) · 759 Bytes
Breadcrumbs
algorithm
/
Week_01
/
id_104
/
LeetCode_242_104.java
Copy path
File metadata and controls
31 lines (28 loc) · 759 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
28
29
30
31
class
Solution
{
public
boolean
isAnagram
(
String
s
,
String
t
) {
// 1.判断两个字符长度是否相等 不等返回false
if
(
s
==
null
&&
t
==
null
){
return
true
;
}
if
(
s
==
null
||
t
==
null
){
return
false
;
}
if
(
s
.
length
()!=
t
.
length
()){
return
false
;
}
boolean
result
=
true
;
int
[]
sAry
=
new
int
[
26
];
int
[]
tAry
=
new
int
[
26
];
for
(
int
i
=
0
;
i
<
s
.
length
();
i
++){
sAry
[
s
.
charAt
(
i
)-
'a'
]++;
tAry
[
t
.
charAt
(
i
)-
'a'
]++;
}
for
(
int
i
=
0
;
i
<
26
;
i
++){
if
(
sAry
[
i
]!=
tAry
[
i
]){
result
=
false
;
break
;
}
}
return
result
;
}
}
Back
|
FazBrowse Home
|
New Git URL