14.一组字符串的最长公共前缀

#include <iostream>
#include <string>
#include <vector>
using namespace std;

class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
string result;
if (strs.empty()) return result;
int i = 0;
while (true)
{
if (i == strs[0].size()) return result;
for (int j = 1; j < strs.size(); ++j)
if (i == strs[j].size() || strs[j][i] != strs[0][i]) return result;
result.push_back(strs[0][i]);
++i;
}
}
};

int main()
{
int n;
Solution so;
while (cin >> n)
{
vector<string> strs(n);
for (int i = 0; i < n; ++i) cin >> strs[i];
cout << so.longestCommonPrefix(strs) << endl;
}
return 0;
}