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.

 一个字符串是否能由另一个字符串打乱顺序而来。

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

版权声明：本文为博主原创文章，未经博主允许不得转载。