class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.empty()) return "";
for(int i = 0; i < strs[0].size(); ++i){
for(int j = 1; j < strs.size(); ++j){
if(i >= strs[j].size() || strs[0][i] != strs[j][i])
return strs[0].substr(0, i);
}
}
return strs[0];
}
};
LeetCode之Longest Common Prefix
最新推荐文章于 2021-01-17 11:24:59 发布