leetcode[1002]Find Common Characters Python3实现（使用Counter类+内置&交集运算）

# Given an array A of strings made only from lowercase letters, return a list of
#  all characters that show up in all strings within the list (including duplicate
# s). For example, if a character occurs 3 times in all strings but not 4 times, y
# ou need to include that character three times in the final answer. 
# 
#  You may return the answer in any order. 
# 
#  
# 
#  
#  Example 1: 
# 
#  
# Input: ["bella","label","roller"]
# Output: ["e","l","l"]
#  
# 
#  
#  Example 2: 
# 
#
# Input: ["cool","lock","cook"]
# Output: ["c","o"]
#  
# 
#  
# 
#  Note: 
# 
#  
#  1 <= A.length <= 100 
#  1 <= A[i].length <= 100 
#  A[i][j] is a lowercase letter 
#  
#  
#  Related Topics 数组 哈希表 
#  👍 160 👎 0


# leetcode submit region begin(Prohibit modification and deletion)
from collections import Counter
class Solution:
    def commonChars(self, A: List[str]) -> List[str]:
        ans = Counter(A[0]) #ans: Counter({'l': 2, 'b': 1, 'e': 1, 'a': 1})
        for i in range(1, len(A)):
            ans &= Counter(A[i])
        return list(ans.elements())
# leetcode submit region end(Prohibit modification and deletion)

参考大神解法，将字符串转换成Counter对象，以此使用&运算符求Counter对象的交集，最后将Counter对象的key值转化为字符串输出接口。