LeetCode: 242. Valid Anagram

最新推荐文章于 2025-05-09 00:08:34 发布

IT技术小密圈

最新推荐文章于 2025-05-09 00:08:34 发布

阅读量186

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 杨领well的 LeetCode 题解专栏

本文链接：https://blog.youkuaiyun.com/yanglingwell/article/details/88048359

LeetCode 同时被 2 个专栏收录

250 篇文章

订阅专栏

杨领well的 LeetCode 题解专栏

241 篇文章

订阅专栏

本文详细解析了LeetCode第242题有效的字母异位词，通过统计两个字符串中各字母出现的次数来判断它们是否为字母异位词。代码实现使用C++，并探讨了如何处理Unicode字符的情况。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LeetCode: 242. 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?

Tips:
An anagram is a word or phrase formed by changing the order of the letters in another word or phrase. For example, “triangle” is an anagram of “integral.”

解题思路

将 a-z 映射到 0-25，用数组统计各单词中各字母出现的次数是否相等。若出现次数相等，则是 Anagram。否则，不是。

AC 代码

class Solution {
public:
    bool isAnagram(string s, string t) {
        int alphaOfS[26] = {0};
        int alphaOfT[26] = {0};
        
        for(char ch : s) ++alphaOfS[ch-'a'];
        for(char ch : t) ++alphaOfT[ch-'a'];
        
        bool ans = true;
        for(int i = 0; i < 26; ++i)
        {
            if(alphaOfS[i] != alphaOfT[i])
            {
                ans = false;
                break;
            }
        }
        
        return ans;
    }
};