class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if (strs.size()==0) {
return "";
}
string ans=strs[0];
for (int i=1; i<strs.size(); i++) {
string str=strs[i];
int j;
for (j=0; j<str.size()&&j<ans.size(); j++) {
if (ans[j]!=str[j]) {
break;
}
}
ans=ans.substr(0,j);
}
return ans;
}
};
LeetCode Longest Common Prefix
最新推荐文章于 2019-04-05 20:58:44 发布