暴力出奇迹??????(击败100%)
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int size = strs.size();
if(size == 0){
return "";
}else if(size == 1){
return strs[0];
}
int len = strs[0].size();
int i, flag = 1;
for (i = 0; i < len; ++i)
{
char c = strs[0][i];
for (int j = 1; j < size; ++j)
{
if(!strs[j][i] || c != strs[j][i]){
return strs[0].substr(0, i);
}
}
}
return strs[0].substr(0, i);
}
};
题目链接:https://leetcode-cn.com/problems/longest-common-prefix/submissions/