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.

Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?

Anagram,相同字母异序词

=========

class {

public:

 bool isAnagram(string s, string t) {

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

        sort(s.begin(),s.end());

        sort(t.begin(),t.end());

        int n = s.size();

        for(int i = ;i<n;i++){

            if(s[i]!=t[i]) return false;

        }

        return true;

    }

};