class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int n = INT_MAX;
for (int i = 0; i < strs.size(); ++i) {
n = min(n, int(strs[i].length()));
}
if (n == INT_MAX) {
return "";
}
int len = 0;
bool flag = true;
while (flag && len < n) {
for (int i = 1; i < strs.size(); ++i) {
if (strs[i][len] != strs[0][len]) {
flag = false;
break;
}
}
if (flag) {
++len;
}
}
return strs[0].substr(0, len);
}
};