【leetcode】【easy】242. Valid Anagram

最新推荐文章于 2021-01-21 04:11:36 发布

原创最新推荐文章于 2021-01-21 04:11:36 发布 · 150 阅读

0 ·

CC 4.0 BY-SA版权

code 同时被 2 个专栏收录

233 篇文章

订阅专栏

c++

230 篇文章

订阅专栏

本文探讨了如何通过两种方法——使用数组和哈希表（map），来判断两个字符串是否为字母异位词。首先介绍了问题背景及示例，然后详细解释了每种方法的实现过程，并对比了它们的优劣。

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?

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

法一：数组

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

法二：map

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