14:最长公共前缀

src/main/java/leetcode/editor/cn/LongestCommonPrefix.java

@@ -0,0 +1,75 @@
+//编写一个函数来查找字符串数组中的最长公共前缀。 
+//
+// 如果不存在公共前缀，返回空字符串 ""。 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：strs = ["flower","flow","flight"]
+//输出："fl"
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：strs = ["dog","racecar","car"]
+//输出：""
+//解释：输入不存在公共前缀。 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= strs.length <= 200 
+// 0 <= strs[i].length <= 200 
+// strs[i] 仅由小写英文字母组成 
+// 
+// Related Topics 字符串 👍 1932 👎 0
+
+package leetcode.editor.cn;
+
+//Java：14:最长公共前缀
+public class LongestCommonPrefix {
+    public static void main(String[] args) {
+        Solution solution = new LongestCommonPrefix().new Solution();
+        // TO TEST
+    }
+
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public String longestCommonPrefix(String[] strs) {
+            if (strs.length == 1) {
+                return strs[0];
+            }
+            int n1 = strs[0].length();
+            int n2 = strs[1].length();
+            int index = 0;
+            String sameStr = "";
+            while (index < n1 && index < n2) {
+                if (strs[0].charAt(index) == strs[1].charAt(index)) {
+                    sameStr += strs[0].charAt(index);
+                    index++;
+                } else {
+                    break;
+                }
+            }
+            for (int i = 2; i < strs.length; i++) {
+                while (!"".equals(sameStr)) {
+                    if (strs[i].startsWith(sameStr)) {
+                        break;
+                    }
+                    sameStr = sameStr.substring(0, sameStr.length() - 1);
+                }
+                if ("".equals(sameStr)) {
+                    return "";
+                }
+            }
+            return sameStr;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

src/main/java/leetcode/editor/cn/doc/content/LongestCommonPrefix.md

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