LintCode 158: Valid Anagram

本文已参与「新人创作礼」活动，一起开启掘金创作之路。

原文链接：blog.csdn.net/roufoo/arti…

Valid Anagram Write a method anagram(s,t) to decide if two strings are anagrams or not. Example Given s = “abcd”, t = “dcab”, return true. Given s = “ab”, t = “ab”, return true. Given s = “ab”, t = “ac”, return false.

Challenge O(n) time, O(1) extra space

Clarification What is Anagram?

Two strings are anagram if they can be the same after change the order of characters.

解法1：

class Solution {
public:
    /**
     * @param s: The first string
     * @param t: The second string
     * @return: true or false
     */
    bool anagram(string &s, string &t) {
        vector<int> counterS(128, 0);
        vector<int> counterT(128, 0);
        
        int lenS = s.size();
        int lenT = t.size();
        
        for (int i = 0; i < lenS; ++i) {
            counterS[s[i]]++;
        }
        
        for (int i = 0; i < lenT; ++i) {
            counterT[t[i]]++;
        }
        
        for (int i = 0; i < 128; ++i) {
            if ((counterS[i] != counterT[i])) return false;
        }
        
        return true;
    }
};