mirror of
https://github.com/devenperez/leetcode.git
synced 2026-06-13 23:07:08 +00:00
Deven
27 lines
945 B
Markdown
27 lines
945 B
Markdown
<h2><a href="https://leetcode.com/problems/longest-common-prefix/">14. Longest Common Prefix</a></h2><h3>Easy</h3><hr><div><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 class="example">Example 1:</strong></p>
|
|
|
|
<pre><strong>Input:</strong> strs = ["flower","flow","flight"]
|
|
<strong>Output:</strong> "fl"
|
|
</pre>
|
|
|
|
<p><strong class="example">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 lowercase English letters.</li>
|
|
</ul>
|
|
</div> |