[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.

判断两个字符串包含的字符是否相同

三行AC

class Solution {
public:
    bool isAnagram(string s, string t) {
    sort(s.begin(),s.end());
    sort(t.begin(),t.end());
    return s==t;
    }
};

[leetcode 242]Valid Anagram

原文：http://blog.csdn.net/er_plough/article/details/47302699