feat: update leetcode solutions: No.0014. Longest Common Prefix

Author: yanglbme

solution/0000-0099/0014.Longest Common Prefix/README.md

@@ -37,15 +37,57 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def longestCommonPrefix(self, strs: List[str]) -> str:
+        n = len(strs)
+        if n == 0:
+            return ''
+        for i in range(len(strs[0])):
+            for j in range(1, n):
+                if len(strs[j]) <= i or strs[j][i] != strs[0][i]:
+                    return strs[0][:i]
+        return strs[0]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public String longestCommonPrefix(String[] strs) {
+        int n;
+        if ((n = strs.length) == 0) return "";
+        for (int i = 0; i < strs[0].length(); ++i) {
+            for (int j = 1; j < n; ++j) {
+                if (strs[j].length() <= i || strs[j].charAt(i) != strs[0].charAt(i)) {
+                    return strs[0].substring(0, i);
+                }
+            }
+        }
+        return strs[0];
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string longestCommonPrefix(vector<string>& strs) {
+        int n;
+        if ((n = strs.size()) == 0) return "";
+        for (int i = 0; i < strs[0].size(); ++i) {
+            for (int j = 1; j < n; ++j) {
+                if (strs[j].size() <= i || strs[j][i] != strs[0][i]) {
+                    return strs[0].substr(0, i);
+                }
+            }
+        }
+        return strs[0];
+    }
+};
 ```
 
 ### **...**

solution/0000-0099/0014.Longest Common Prefix/README_EN.md

@@ -41,13 +41,55 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def longestCommonPrefix(self, strs: List[str]) -> str:
+        n = len(strs)
+        if n == 0:
+            return ''
+        for i in range(len(strs[0])):
+            for j in range(1, n):
+                if len(strs[j]) <= i or strs[j][i] != strs[0][i]:
+                    return strs[0][:i]
+        return strs[0]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public String longestCommonPrefix(String[] strs) {
+        int n;
+        if ((n = strs.length) == 0) return "";
+        for (int i = 0; i < strs[0].length(); ++i) {
+            for (int j = 1; j < n; ++j) {
+                if (strs[j].length() <= i || strs[j].charAt(i) != strs[0].charAt(i)) {
+                    return strs[0].substring(0, i);
+                }
+            }
+        }
+        return strs[0];
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    string longestCommonPrefix(vector<string>& strs) {
+        int n;
+        if ((n = strs.size()) == 0) return "";
+        for (int i = 0; i < strs[0].size(); ++i) {
+            for (int j = 1; j < n; ++j) {
+                if (strs[j].size() <= i || strs[j][i] != strs[0][i]) {
+                    return strs[0].substr(0, i);
+                }
+            }
+        }
+        return strs[0];
+    }
+};
 ```
 
 ### **...**

solution/0000-0099/0014.Longest Common Prefix/Solution.cpp

@@ -1,37 +1,15 @@
-static int x=[](){
-    std::ios::sync_with_stdio(false);
-    cin.tie(NULL);
-    return 0;
-}();
-string Compare(string s1,string s2)
-{
-    if(s1.size()==0||s2.size()==0)
-        return "";
-    int num=s1.size()<s2.size()?s1.size():s2.size();
-    string s;
-    for(int i=0;i<num;i++)
-    {
-        if(s1[i]==s2[i])
-        {
-            s.push_back(s1[i]);
-        }
-        else
-            break;
-        
-    }
-    return s;
-}
 class Solution {
 public:
     string longestCommonPrefix(vector<string>& strs) {
-        if(strs.size()==0)
-            return "";
-        string prefix=strs[0];
-        for(int i=1;i<strs.size();i++)
-        {
-            prefix=Compare(prefix,strs[i]);
+        int n;
+        if ((n = strs.size()) == 0) return "";
+        for (int i = 0; i < strs[0].size(); ++i) {
+            for (int j = 1; j < n; ++j) {
+                if (strs[j].size() <= i || strs[j][i] != strs[0][i]) {
+                    return strs[0].substr(0, i);
+                }
+            }
         }
-        return prefix;
-        
+        return strs[0];
     }
-};
+};

solution/0000-0099/0014.Longest Common Prefix/Solution.java

@@ -1,35 +1,14 @@
 class Solution {
     public String longestCommonPrefix(String[] strs) {
-        if (strs == null || strs.length == 0) {
-            return "";
-        }
-        if (strs.length == 1) {
-            return strs[0];
-        }
-        
-        char[] chars = strs[0].toCharArray();
-        int i = 0;
-        boolean flag = true;
-        for (; i < chars.length; ++i) {
-            char ch = chars[i];
-            
-            for (int j = 1; j < strs.length; ++j) {
-                if (strs[j].length() <= i) {
-                    flag = false;
-                    break;
+        int n;
+        if ((n = strs.length) == 0) return "";
+        for (int i = 0; i < strs[0].length(); ++i) {
+            for (int j = 1; j < n; ++j) {
+                if (strs[j].length() <= i || strs[j].charAt(i) != strs[0].charAt(i)) {
+                    return strs[0].substring(0, i);
                 }
-                if (strs[j].charAt(i) != ch) {
-                    flag = false;
-                    break;
-                }
-                
-            }
-            if (!flag) {
-                break;
             }
         }
-        return strs[0].substring(0, i);
-        
-        
+        return strs[0];
     }
 }

solution/0000-0099/0014.Longest Common Prefix/Solution.py

@@ -1,25 +1,10 @@
 class Solution:
-    def longestCommonPrefix(self, strs):
-        """
-        :type strs: List[str]
-        :rtype: str
-        """
-        if strs == []:
+    def longestCommonPrefix(self, strs: List[str]) -> str:
+        n = len(strs)
+        if n == 0:
             return ''
-        if len(strs) == 1:
-            return strs[0]
-        strs.sort(key=lambda x : len(x))
-        flag=False
-        prefix=''
-        for j in range(1,len(strs[0])+1):
-            prefix=strs[0][:j]
-            for i in range(1,len(strs)):
-                if prefix == strs[i][:j]:
-                    flag=True
-                else:
-                    flag=False
-                if not flag:
-                    prefix0=prefix[:-1]
-                    return prefix0
-                    break
-        return prefix
+        for i in range(len(strs[0])):
+            for j in range(1, n):
+                if len(strs[j]) <= i or strs[j][i] != strs[0][i]:
+                    return strs[0][:i]
+        return strs[0]