Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
思路:
1)找到最短的字符串,因为最长子串不会比这个长;
2)一个一个字符比较,直到有不同的,退出,输出res
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string res;
int n=strs.size();
if(n==0) return res;
if(n==1) return strs[0];
string small;
int length=100000;
for(int i=0;i<n;i++)
{
if(length>strs[i].length())
{length=strs[i].length();small=strs[i];}
}
for(int i=0;i<length;i++)
{
for(int j=0;j<n;j++)
{
if(strs[j][i]!=small[i]) return res;
}
res.push_back(small[i]);
}
return res;
}
};