LeetCode 242. 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) {
        sort(s.begin(),s.end());
        sort(t.begin(),t.end());
        int l1=s.length();
        int l2=t.length();
        if(l1!=l2) return false;
        for(int i=0;i<l1;i++){
            if(s[i]!=t[i]) return false;
        }
        return true;
    }
};