LeetCode 242. Valid Anagram

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 {
public:
    bool isAnagram(string s, string t) {
        int a[26] = {0};
        if(s.length() != t.length())
            return 0;
        for(int i = 0; i < s.length(); i++) {
            a[s[i] - 'a']++;
        }
        for(int i = 0; i < t.length(); i++) {
            a[t[i] -'a']--;
        }
        for(int i = 0; i < 26; i++) {
            if(a[i] != 0) {
                return 0;
            }
        }
        return 1;
    }
};

class Solution {

public:

bool isAnagram(string s, string t) {

int a[26] = {0};

if(s.length() != t.length())

return 0;

for(int i = 0; i < s.length(); i++) {

a[s[i] - 'a']++;

}

for(int i = 0; i < t.length(); i++) {

a[t[i] -'a']--;

}

for(int i = 0; i < 26; i++) {

if(a[i] != 0) {

return 0;

}

return 1;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版