public class Solution { public string LongestCommonPrefix(string[] strs) { if (strs.Length == 0) { return ""; } else if (strs.Length == 1) { return strs[0]; } else { var maxLen = 1; var len = strs.Length; while (true) { for (int i = 0; i < len - 1; i++) { var s1 = strs[i]; var s2 = strs[i + 1]; if (s1.Length < maxLen || s2.Length < maxLen) { return strs[0].Substring(0, maxLen - 1); } if (s1.Substring(0, maxLen) != s2.Substring(0, maxLen)) { return strs[0].Substring(0, maxLen - 1); } } maxLen++; } } } }
https://leetcode.com/problems/longest-common-prefix/#/description