题目:https://leetcode-cn.com/problems/longest-common-prefix/
代码:class Solution {
public:
string longestCommonPrefix(vector& strs) {
int size = strs.size();
string result;
if(size==0)
{
return "";
}
int size1 = strs[0].length();
int i = 0 ;
while(i < size1)
{
bool c = true;
for(int k = 1; k < size;k++)
{
int size2 = strs[k].length();
string tmp = strs[k];
if(i >= size2||tmp[i]!=strs[0][i])
{
return result;
}
}
if(c == true)
{
result += strs[0][i];
}
i++;
}
return result;
}
};
结果: