leetcode之242. Valid Anagram（C++解法）

题目：
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 count_s[26]={0}, count_t[26]={0};
if (s.length() != t.length())
return false;
for (int i=0;i