class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
int N = strs.size();
if (N == 0) return "";
int l = 0;
while (l < strs[0].size()) {
for (int i = 1; i < N; i++) {
if (l == strs[i].size() || strs[i][l] != strs[0][l])
return strs[i].substr(0, l);
}
l++;
}
return strs[0];
}
};
Longest Common Prefix
最新推荐文章于 2024-02-18 12:25:05 发布