Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
解题思路:
此题解题方法比较简单,因为要找出公共前缀。所以先将prefix设置为最短的那个字符串,逐个与每一个字符串对比,找出公共前缀。
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++)
{
if(prefix.size()==0 || strs[i].size()==0)
return "";
int len=prefix.length()>strs[i].size()?strs[i].size():prefix.size();
int k=0;
for(k=0;k<len;k++)
{
if(prefix[k]!=strs[i][k])
break;
}
prefix=prefix.substr(0,k);
}
return prefix;
}
};