```cpp
在这里插入代码片
class Solution {
public:
/**
*
* @param strs string字符串vector
* @return string字符串
*/
string longestCommonPrefix(vector<string>& strs) {
// write code here
int n = 0;
n = strs.size();
int minL = 999999;//不是0!!!
string res="";
if(strs.empty())
{
return res;
}
if(n == 1)
{
for( auto c : strs)
{
res += c;
}
return res;
}
for (int i = 0; i < n; i++)
{
minL = minL < strs[i].length() ? minL : strs[i].length();
}
for(int i = 0; i < minL; i++)
{
for( int j = 1; j < n; j++)
{
if(strs[0][i] != strs[j][i] )
{
return res;
}
}
res = res + strs[0][i];
}
return res;
}
};
记录最长公共前缀
最新推荐文章于 2024-07-04 16:59:35 发布