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(object):
    def isAnagram(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: bool
        """
       #排序法
       return sorted(s) == sorted(t)

       #字符统计法
        from collections import Counter
        return Counter(s).elements== Counter(t).elements

242. Valid Anagram

标签：

原文地址：http://www.cnblogs.com/sxbjdl/p/5280796.html