/
Solution.java
45 lines (40 loc) · 1.27 KB
/
Solution.java
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
/**
* Time : O() ; Space: O()
* @tag : Hash Table; Sort
* @by : Steven Cooks
* @date: Aug 17, 2015
***************************************************************************
* Description:
*
* Given two strings s and t, write a function to determine if t is an anagram of s.
* For example,
* s = "anagram", t = "nagaram", return true.
* s = "rat", t = "car", return false.
* Note: You may assume the string contains only lowercase alphabets.
*
***************************************************************************
* {@link https://leetcode.com/problems/valid-anagram/ }
*/
package _242_ValidAnagram;
/** see test {@link _242_ValidAnagram.SolutionTest } */
public class Solution {
public boolean isAnagram(String s, String t) {
if (s.length() != t.length()) {
return false;
}
// since input contains only lowercase alphabets
int[] counts = new int[26];
// count character occurrence
for (int i = 0; i < s.length(); i++) {
counts[s.charAt(i) - 'a']++;
counts[t.charAt(i) - 'a']--;
}
// check
for (int i = 0; i < 26; i++) {
if (counts[i] != 0) {
return false;
}
}
return true;
}
}