#include <iostream>
#include <algorithm>
#include "string"
#include "vector"
using namespace std;
string longestCommonPrefix(vector<string>& strs)
{
string res = "";
if (strs.empty()) return res;
for (int j=0; j<strs[0].size(); j++)
{
int i = 0;
for (; i<strs.size(); i++)
{
if (strs[i][j] != strs[0][j]) break;
}
if (i != strs.size()) break;
res += strs[0][j];
}
return res;
}
int main()
{
vector<string>v1;
v1.push_back("flower");
v1.push_back("flow");
v1.push_back("flight");
cout << longestCommonPrefix(v1);
system("pause");
return 0;
}