242. Valid Anagram

最新推荐文章于 2016-07-15 14:58:48 发布

zoojing

最新推荐文章于 2016-07-15 14:58:48 发布

阅读量89

点赞数

分类专栏： leetcode python 文章标签： leetcode python

本文链接：https://blog.csdn.net/zoojing/article/details/50823534

版权

python 同时被 2 个专栏收录

60 篇文章 0 订阅

订阅专栏

leetcode

44 篇文章 0 订阅

订阅专栏

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.

Method 1

class Solution(object): 
def isAnagram(self, s, t): 
“”” 
:type s: str 
:type t: str 
:rtype: bool 
“”” 
if len(s) == len(t): 
    dict1 = {} 
    dict2 = {} 
    for i in range(len(s)): 
        dict1[s[i]] = dict1.get(s[i], 0) + 1 
    for i in range(len(t)): 
        dict2[t[i]] = dict2.get(t[i], 0) + 1 
    if dict1 == dict2: 
        return True 
    else: 
        return False 
else: 
    return False

Method 2

class Solution(object):
def isAnagram(self, s, t):
    """
    :type s: str
    :type t: str
    :rtype: bool
    """
    return sorted(s) == sorted(t)