23 lines
519 B
Java
23 lines
519 B
Java
|
package com.zerroi.leetcode.Three19;
|
||
|
|
||
|
public class IsAnagram {
|
||
|
public static void main(String[] args) {
|
||
|
|
||
|
}
|
||
|
}
|
||
|
|
||
|
class SolutionFirst {
|
||
|
public boolean isAnagram(String s, String t) {
|
||
|
if (s.length() != t.length()) return false;
|
||
|
int[] count = new int[26];
|
||
|
for (char c : s.toCharArray()) {
|
||
|
count[c - 'a']++;
|
||
|
}
|
||
|
for (char c : t.toCharArray()) {
|
||
|
count[c - 'a']--;
|
||
|
if (count[c - 'a'] < 0) return false;
|
||
|
}
|
||
|
return true;
|
||
|
}
|
||
|
}
|