题目就是找最长公共前缀,很简单,直接写代码:
class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
if(strs.empty())
return "";
else if(strs.size() == 1)
return strs[0];
else
{
string ret = "";
int num = 0;
char c = strs[0][num];
while(true)
{
for(vector<string>::size_type st = 0; st < strs.size(); st ++)
{
if(num < strs[st].size() && strs[st][num] == c)
{
if(st == strs.size()-1)
{
ret += c;
num ++;
c = strs[0][num];
}
}
else
return ret;
}
}
}
}
};