1.Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
Difficulty:Easy
Explanation:
1.首先将数组中的字符串元素按长度从小到大排序,最长公共字串的长度不能超过最短的字符串的长。排序完成之后,利用查找最大公共字串的方法即可找到最长公共前缀。
code:
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string res="";
int min;
if(strs.size()==0)return "";
for (int i = 0; i < strs.size(); i++)
{
min = i;
for (int j = i; j < strs.size(); j++)
{
if (strs[min].size() > strs[j].size())
{
min = j;
}
}
string temp = strs[min];
strs[min] = strs[i];
strs[i] = temp;
}
for (int i = 0; i < strs[0].size(); i++)
{
for (int j = 0; j < strs.size(); j++)
{
if (strs[j][i] != strs[0][i])
{
return res;
}
}
res += strs[0][i];
}
return res;
}
};