# 242.Valid-Anagram

## 242. 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;
  }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/string/242.valid-anagram.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.