0:00 題目說明
1:41 Python程式解說
4:42 解法複雜度分析
6:46 Java程式解說
Problem:https://leetcode.com/problems/group-anagrams/
N is the length of strs, K is the maximum length of a string in strs
Time complexity: O(NKlogK)
Space Complexity: O(NK)
Code:
Python: https://github.com/kobukuro/leetcode/blob/master/problems/medium/group_anagrams_49/solution.py
Java: https://github.com/kobukuro/leetcode-java/blob/master/src/GroupAnagrams49.java
