<\/span><\/h2>\n\n\n\nWrite a function to find the longest common prefix string amongst an array of strings.<\/p>\n\n\n\n
If there is no common prefix, return an empty string \"\"<\/code>.<\/p>\n\n\n\n<\/span>Example 1 :<\/strong><\/span><\/h3>\n\n\n\n\nInput: strs = [\"flower\",\"flow\",\"flight\"]\r\nOutput: \"fl\"\n<\/code><\/pre>\n\n\n\n<\/span>Example 2 :<\/strong><\/span><\/h3>\n\n\n\n\nInput: strs = [\"dog\",\"racecar\",\"car\"]\r\nOutput: \"\"\r\nExplanation: There is no common prefix among the input strings.\n<\/code><\/pre>\n\n\n\n<\/span>Constraints<\/strong><\/span><\/h3>\n\n\n\n1 <= strs.length <= 200<\/code><\/li>0 <= strs[i].length <= 200<\/code><\/li>strs[i]<\/code> consists of only lowercase English letters.<\/li><\/ul>\n\n\n\nNow, let’s see the code of 14. Longest Common Prefix<\/strong><\/strong> – Leetcode Solution.<\/p>\n\n\n\n<\/span>Longest Common Prefix<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> – Leetcode Solution<\/span><\/h1>\n\n\n\n<\/span>14. Longest Common Prefix<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> – Solution in Java<\/strong><\/span><\/h3>\n\n\n\nclass Solution {\n public String longestCommonPrefix(String[] strs) {\n if (strs == null || strs.length == 0)\n return \"\";\n\n Arrays.sort(strs);\n String first = strs[0];\n String last = strs[strs.length - 1];\n int c = 0;\n while(c < first.length())\n {\n if (first.charAt(c) == last.charAt(c))\n c++;\n else\n break;\n }\n return c == 0 ? \"\" : first.substring(0, c);\n }\n }\n<\/pre>\n\n\n\n<\/span>14. Longest Common Prefix<\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong><\/strong> – Solution in <\/strong>C++<\/strong><\/span><\/h3>\n\n\n\nclass Solution {\npublic:\n string longestCommonPrefix(vector<string>& str) {\n int n = str.size();\n if(n==0) return \"\";\n \n string ans = \"\";\n sort(begin(str), end(str));\n string a = str[0];\n string b = str[n-1];\n \n for(int i=0; i<a.size(); i++){\n if(a[i]==b[i]){\n ans = ans + a[i];\n }\n else{\n break;\n }\n }\n \n return ans;\n \n }\n};<\/pre>\n\n\n\n<\/span>14. Longest Common Prefix<\/strong> – Solution in <\/strong><\/strong>Python<\/strong><\/span><\/h3>\n\n\n\nclass Solution(object):\n def longestCommonPrefix(self, strs):\n \"\"\"\n :type strs: List[str]\n :rtype: str\n \"\"\"\n if not strs:\n return \"\"\n shortest = min(strs,key=len)\n for i, ch in enumerate(shortest):\n for other in strs:\n if other[i] != ch:\n return shortest[:i]\n return shortest\n <\/pre>\n\n\n\n