leetcode 242. Valid Anagram

最新推荐文章于 2025-12-27 20:58:23 发布

原创最新推荐文章于 2025-12-27 20:58:23 发布 · 436 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

数据结构与算法同时被 2 个专栏收录

213 篇文章

订阅专栏

196 篇文章

订阅专栏

本文介绍了一种通过比较两个字符串中字符出现次数的方法来判断它们是否互为字谜(anagram)。提供了具体的实现代码，并探讨了如何适应Unicode字符的情况。

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

For example,
s = "anagram", t = "nagaram", return true.
s = "rat", t = "car", return 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 {
	map<char, int>get_cnt(string s)
	{
		map<char, int>cnt;
		for (int i = 0; i < s.length(); i++)
			cnt[s[i]]++;
		return cnt;
	}
public:
	bool isAnagram(string s, string t) {
		return s.length() == t.length() ? get_cnt(s) == get_cnt(t) : false;
	}
};