[copy title]:
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.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
[brute force solution]:
Time analysis:
Space Analysis:
[Optimized]:
Time analysis:
Space Analysis:
[Wonderful output conditions]:
[Wonderful corner case]:
[Thinking question]:
[One sentence idea]:
[Input amount]: Empty: Normal situation: Extra large: Extra small: Special situations handled in the program: Abnormal situations (Illegal and unreasonable input):
[Paint]:
[One brush]:
[Second brush]:
[Three brushes]:
[Four brushes]:
[Five brushes]:
[Results of five-minute naked eye debug]:
[Summarize]:
[Complexity]: Time complexity: O( ) Space complexity: O( )
[English data structures or algorithms, why not use other data structures or algorithms]:
[Key templating code]:
[Other solutions]:
［Follow Up］：
[The topics given by LC change and change]:
[Code style]: