Write a function to find the longest common prefix string amongst an array of strings.<\/p>\n
If there is no common prefix, return an empty string\u00a0 Example 1:<\/strong><\/p>\n Example 2:<\/strong><\/p>\n Note:<\/strong><\/p>\n All given inputs are in lowercase letters\u00a0 Python<\/strong><\/p>\n csharp<\/strong><\/p>\n\"\"<\/code>.<\/p>\nInput: <\/strong>[\"flower\",\"flow\",\"flight\"]\r\nOutput:<\/strong> \"fl\"\r\n<\/pre>\n
Input: <\/strong>[\"dog\",\"racecar\",\"car\"]\r\nOutput:<\/strong> \"\"\r\nExplanation:<\/strong> There is no common prefix among the input strings.\r\n<\/pre>\n
a-z<\/code>.<\/p>\n \r\nclass Solution(object):\r\n def longestCommonPrefix(self, strs):\r\n """\r\n :type strs: List[str]\r\n :rtype: str\r\n """\r\n result_str = ""\r\n if strs is not None and len(strs) > 0:\r\n strs.sort()\r\n str_first = strs[0]\r\n str_last = strs[len(strs)-1]\r\n a = 0\r\n for i in str_first:\r\n if i == str_last[a]:\r\n result_str += i\r\n a += 1\r\n else:\r\n return result_str\r\n return result_str\r\n<\/pre>\n
\r\npublic class Solution {\r\n public string LongestCommonPrefix(string[] strs) {\r\n string result_str = "";\r\n if (strs != null && strs.Length > 0)\r\n {\r\n Array.Sort(strs);\r\n string str_first = strs[0];\r\n string str_last = strs[strs.Length - 1];\r\n int a = 0;\r\n foreach(var i in str_first)\r\n {\r\n if (string.Equals(i,str_last[a]))\r\n {\r\n result_str += i;\r\n a++;\r\n\r\n }\r\n else\r\n {\r\n return result_str;\r\n }\r\n }\r\n\r\n }\r\n\r\n return result_str;\r\n }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"