给k个字符串,求出他们的最长公共前缀(LCP)
样例
样例 1:
输入: "ABCD", "ABEF", "ACEF"
输出: "A"
样例 2:
输入: "ABCDEFG", "ABCEFG" and "ABCEFA"
输出: "ABC"
class Solution {
public:
/**
* @param strs: A list of strings
* @return: The longest common prefix
*/
string longestCommonPrefix(vector<string> &strs) {
// write your code here
string ret;
if(strs.size() == 0)
return ret;
for(int i = 0; i < strs[0].size(); i++)
{
bool is = true;
for(int j = 1; j < strs.size(); j++)
{
if(i == strs[j].size())
{
is = false;
}
else if(strs[j][i] != strs[0][i])
{
is = false;
}
}
if(is == true)
{
ret = ret + strs[0][i];
}
else
{
break;
}
}
return ret;
}
};