# 最长公共前缀

<p>编写一个函数来查找字符串数组中的最长公共前缀。</p><p>如果不存在公共前缀，返回空字符串 <code>""</code>。</p><p> </p><p><strong>示例 1：</strong></p><pre><strong>输入：</strong>strs = ["flower","flow","flight"]<strong><br />输出：</strong>"fl"</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>strs = ["dog","racecar","car"]<strong><br />输出：</strong>""<strong><br />解释：</strong>输入不存在公共前缀。</pre><p> </p><p><strong>提示：</strong></p><ul>	<li><code>0 <= strs.length <= 200</code></li>	<li><code>0 <= strs[i].length <= 200</code></li>	<li><code>strs[i]</code> 仅由小写英文字母组成</li></ul>

## template

```python
from typing import List
class Solution:
	def longestCommonPrefix(self, strs: List[str]) -> str:
		if len(strs) == 0:
			return ''
		i = 0
		lcp = []
		while True:
			done = False
			if i >= len(strs[0]):
				break
			j = 0
			while j < len(strs):
				if i < len(strs[j]):
					if strs[j][i] != strs[0][i]:
						done = True
						break
				else:
					done = True
					break
				j += 1
			if not done:
				lcp.append(strs[0][i])
				i += 1
			else:
				break
		return ''.join(lcp)
# %%
s = Solution()
print(s.longestCommonPrefix(strs = ["flower","flow","flight"]))
```

## 答案

```python

```

## 选项

### A

```python

```

### B

```python

```

### C

```python

```