mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
29 lines
877 B
HTML
29 lines
877 B
HTML
<p>Write a function to find the longest common prefix string amongst an array of strings.</p>
|
|
|
|
<p>If there is no common prefix, return an empty string <code>""</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> strs = ["flower","flow","flight"]
|
|
<strong>Output:</strong> "fl"
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> strs = ["dog","racecar","car"]
|
|
<strong>Output:</strong> ""
|
|
<strong>Explanation:</strong> There is no common prefix among the input strings.
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= strs.length <= 200</code></li>
|
|
<li><code>0 <= strs[i].length <= 200</code></li>
|
|
<li><code>strs[i]</code> consists of only lower-case English letters.</li>
|
|
</ul>
|