Leetcode 748. 最短补全词 (字符串cnt模拟)
class Solution:def shortestCompletingWord(self, licensePlate: str, words: List[str]) -> str:cnt = Counter(ch.lower() for ch in licensePlate if ch.isalpha())return min((word for word in words if not
·
class Solution:
def shortestCompletingWord(self, licensePlate: str, words: List[str]) -> str:
cnt = Counter(ch.lower() for ch in licensePlate if ch.isalpha())
return min((word for word in words if not cnt - Counter(word)), key=len)
开放原子开发者工作坊旨在鼓励更多人参与开源活动,与志同道合的开发者们相互交流开发经验、分享开发心得、获取前沿技术趋势。工作坊有多种形式的开发者活动,如meetup、训练营等,主打技术交流,干货满满,真诚地邀请各位开发者共同参与!
更多推荐
已为社区贡献4条内容
所有评论(0)