【刷leetcode，拿Offer-035】242. Valid Anagram

题目链接：https://leetcode.com/problems/valid-anagram/

题面：

242. Valid Anagram

Easy

729109FavoriteShare

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?

题意：

判断两个字符串是否相同字母异序词。

解题：

计数即可。

代码：

class Solution {
public:
    bool isAnagram(string s, string t) {
        int key[26]={0};
        if(s.length()!=t.length())return false;
        for(int i=0;i<s.length();i++)
            key[s[i]-'a']++;
        for(int i=0;i<t.length();i++)
            key[t[i]-'a']--;
        for(int i=0;i<26;i++)
            if(key[i])return false;
        return true;
    }
};