题目:
Write a function to find the longest common prefix string amongst an array of strings.
难度:
Easy
思路: 从头开始比较每个字符串,不等就停止循环即可
代码如下
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.empty())
return "";
for(int i=0;i<strs[0].length();i++)
for(int j=0;j<strs.size();j++){
if(i>=strs[0].length()||strs[0][i]!=strs[j][i])
return strs[0].substr(0,i);
}
return strs[0];
}
};