242. Valid Anagram

标签：

Problem:

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.

A possible answer：

first：sort

second： compare

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

242. Valid Anagram

标签：

原文地址：http://www.cnblogs.com/liutianyi10/p/5540350.html