Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit02db10e

Browse files
valid anagram
1 parentdeaefd8 commit02db10e

File tree

1 file changed

+28
-0
lines changed

1 file changed

+28
-0
lines changed

‎EASY/src/easy/ValidAnagram.java

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
packageeasy;
2+
3+
importjava.util.Arrays;
4+
5+
publicclassValidAnagram {
6+
publicbooleanisAnagram_solution1(Strings,Stringt) {
7+
//I even thought about using HashMap to compute their character frequencies respectively and then compare each entry of the two maps, but totally unnecessary.
8+
char[]schar =s.toCharArray();
9+
char[]tchar =t.toCharArray();
10+
Arrays.sort(schar);
11+
Arrays.sort(tchar);
12+
returnnewString(schar).equals(newString(tchar));
13+
}
14+
15+
//another way: altough much slower
16+
publicbooleanisAnagram_solution2(Strings,Stringt) {
17+
if(s ==null ||t ==null ||s.length() !=t.length())returnfalse;
18+
int[]counts =newint[26];
19+
for(inti =0;i <s.length();i++){
20+
counts[s.charAt(i) -'a']++;
21+
counts[t.charAt(i) -'a']--;
22+
}
23+
for(inti :counts){
24+
if(i !=0)returnfalse;
25+
}
26+
returntrue;
27+
}
28+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp