FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
algorithm/Week_02/id_30/LeetCode_242_30.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_02
/
id_30
/
LeetCode_242_30.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
41 lines (34 loc) · 955 Bytes
Breadcrumbs
algorithm
/
Week_02
/
id_30
/
LeetCode_242_30.java
Copy path
File metadata and controls
41 lines (34 loc) · 955 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
32
33
34
35
36
37
38
39
40
package
com
.
shufeng
.
algorithm
.
d0_
;
/**
* @author gsf
*/
public
class
LeetCode_242_30
{
public
static
void
main
(
String
[]
args
) {
System
.
out
.
println
((
int
)
'a'
);
String
s
=
"aa"
,
t
=
"bb"
;
System
.
out
.
println
(
isAnagram1
(
s
,
t
));
}
public
static
boolean
isAnagram1
(
String
s
,
String
t
) {
if
(
s
.
length
() !=
t
.
length
()) {
return
false
;
}
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
:
arr
) {
if
(
i
!=
0
) {
return
false
;
}
}
return
true
;
}
public
static
boolean
isAnagram
(
String
s
,
String
t
) {
char
[]
ss
=
s
.
toCharArray
();
char
[]
tt
=
t
.
toCharArray
();
Arrays
.
sort
(
ss
);
Arrays
.
sort
(
tt
);
return
String
.
valueOf
(
ss
).
equals
(
String
.
valueOf
(
tt
));
}
}
Back
|
FazBrowse Home
|
New Git URL