Write a function to find the longest common prefix string amongst an array of strings.
求一个字符串数组中的所有字符串的最长公共前缀,这个就一个一个字符串从头比较就行了。
class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
int v_len = strs.size();
if (v_len == 0) return "";
if (v_len == 1) return strs[0];
string res = "";
bool flag = true;
for (int i = 0; i < strs[0].size(); ++i)
{
for (int j = 0; j < v_len - 1; ++j)
{
if (strs[j][i] != strs[j + 1][i])
{
flag = false;
break;
}
}
if (flag)
res.push_back(strs[0][i]);
else
break;
}
return res;
}
};