摘要: 方法1: class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: if not strs: return "" ans = strs[0] i = 1 while i < len(strs): while strs 阅读全文
posted @ 2021-01-09 11:49 WangSJiNa 阅读(50) 评论(0) 推荐(0)