static auto _ = [](){std::ios::sync_with_stdio(false);std::cin.tie(NULL);return 0;}();
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int index = 0;
int minLen = 99999999;
if (strs.size() == 0)
return string("");
for (string s : strs)
minLen = min((int)s.length(), minLen);
while(index < minLen){
char c = strs[0][index];
for (int i = 1; i < strs.size(); i++)
if (strs[i][index] != c){
return strs[0].substr(0, index);
}
index++;
}
return strs[0].substr(0, index);
}
};
LetCode 14. 最长公共前缀
最新推荐文章于 2022-06-16 22:11:24 发布