# 242.Valid-Anagram

## 242. Valid Anagram

## 题目地址

[https://leetcode.com/problems/valid-anagram/](https://leetcode.com/problems/valid-anagram/)

## 题目描述

```
Given two strings s and t , write a function to determine if t is an anagram of s.

Example 1:
Input: s = "anagram", t = "nagaram"
Output: true

Example 2:
Input: s = "rat", t = "car"
Output: false

Note:
You may assume the string contains only lowercase alphabets.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
```

## 代码

### Approach #1 Sorting

```java
class Solution {
  public boolean isAnagram(String s, String t) {
        if (s.length() != t.length())     return false;
    char[] str1 = s.toCharArray();
    char[] str2 = t.toCharArray();
    Arrays.sort(str1);
    Arrays.sort(str2);
    return Arrays.equals(str1, str2);
  }
}
```

### Approach #2 HashTable

```java
class Solution {
  public boolean isAnagram(String s, String t) {
    if (s.length() != t.length())    return false;
    int[] counter = new int[26];
    for (int i = 0; i < s.length; i++) {
      counter[s.charAt(i) - 'a']++;
      counter[t.charAt(i) - 'a']--;
    }
    for (int count: counter) {
      if (count != 0)     return false;
    }
    return true;
  }
}
```
