class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string s = "";
const int len = strs.size();
if(len == 0) return s;
string cur = strs[0];
for(int j = 0; j < cur.length(); j++){
for(int i = 1; i < len; i++){
if(strs[i][j] != cur[j]) return s;
}
s += cur[j];
}
return s;
}
};
Longest Common Prefix
最新推荐文章于 2020-07-03 09:58:21 发布