14. Longest Common Prefix
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.empty()) return "";
for (int j = 0; j < strs[0].size(); ++j) {
for (int i = 0; i < strs.size() - 1; ++i) {
if (j >= strs[i].size() || j >= strs[i + 1].size() || strs[i][j] != strs[i + 1][j]) {
return strs[i].substr(0, j);
}
}
}
return strs[0];
}
};
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.size()<1) return "";
for(int i = 0; i<strs[0].size();++i){
for(int j = 1;j<strs.size();++j){
if(i >= strs[j].size() || strs[j][i] != strs[0][i] ) return strs[0].substr(0,i);
}
}
return strs[0];
}
};