题目:寻找字符串数组的最长公共前缀
例如:strs=["apple","abstract","a","abcd"],输出结果为"a"
例如:strs=["apple","abstract","a","abcd"],输出结果为"a"
思路:对所有字符串从第一个位置开始逐一比较。
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string prefix ="";
if (strs.size() == 0)
return prefix;
else
{
int len = 99999;
for (int i = 0; i < strs.size(); i++)
{
if (strs[i].length() < len)
{
len = strs[i].length();
}
}
for (int i = 0; i < len; i++)
{
for (int j = 0; j < strs.size() - 1; j++)
{
if (strs[j][i] != strs[j + 1][i])
return prefix;
}
prefix += strs[0][i];
}
return prefix;
}
}
};