242. Valid Anagram Add to List

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;
         else{
             sort(s.begin(),s.end());
             sort(t.begin(),t.end());
             if(s==t)
                 return true;
             else
                 return false;
         }

     }
 };