150强访谈简单

有效的字谜词

“有效字谜”问题的详细指南和 Python 实现。

问题陈述

简单

给定两个字符串 st,如果 ts 的字谜,则返回 True,否则返回 False

字谜词是通过使用所有原始字母一次重新排列不同单词或短语的字母而形成的单词或短语。

编写一个函数 isAnagram(s: str, t: str) -> bool

约束条件
  • 1 <= len(s), len(t) <= 5 * 10^4
  • s and t consist of lowercase English letters

示例

Example 1
Input
s = "anagram", t = "nagaram"
Output
True
Explanation

Both strings contain the same characters with the same frequencies: a(3), n(1), g(1), r(1), m(1).

Example 2
Input
s = "rat", t = "car"
Output
False
Explanation

'rat' contains 't' but 'car' does not. They have different character compositions.

Need a Hint?
考虑使用数组和哈希特定的数据结构,例如集合或堆。
Edge Cases to Watch
  • 空输入结构
  • 单元素输入
  • 大数值范围

准备好解决了吗?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

在编辑器中打开
Found this breakdown helpful?

PyRun is built and maintained by an independent solo developer. If this helped your interview prep, consider buying a coffee!

Buy me a coffee

推荐的 Python 资源

通过相关的交互式教程、备忘单和代码比较来扩展您的知识。