예제 #1
0
"""
Given two strings s and t , write a function to determine if t is an anagram of s.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
Note:
You may assume the string contains only lowercase alphabets.
Reference: https://leetcode.com/problems/valid-anagram/description/
"""
from algorithms.map import is_anagram

s = "anagram"
t = "nagaram"
print(is_anagram(s,t))


예제 #2
0
 def test_is_anagram(self):
     self.assertTrue(is_anagram("anagram", "nagaram"))
     self.assertFalse(is_anagram("rat", "car"))
예제 #3
0
 def test_is_anagram(self):
     self.assertTrue(is_anagram("anagram", "nagaram"))
     self.assertFalse(is_anagram("rat", "car"))