LeetCode242——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) {

if (s.size() != t.size()) return false;

int bit[26] = {0}, len = s.length();

for(int i=0; i<len; i++)

bit[s[i]-‘a‘]++;

for(int i=0; i<len; i++)

if(--bit[t[i]-‘a‘] < 0)

return false;

return true;

}

};

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