您的位置:首页 > 其它

[LeetCode] Longest Common Prefix

2014-03-11 10:04 211 查看
Write a function to find the longest common prefix string amongst an array of strings.

Solution:

class Solution {
public:
string longestCommonPrefix(vector<string> &strs) {
int len = 0, n = strs.size(), MaxL = 0;
if(n == 0) return "";
else if(n == 1) return strs[0];

for(int i = 0;i < n;i++)
if(strs[i].length() > MaxL)
MaxL = strs[i].length();

bool flag = true;
while(flag)
{
if(len >= MaxL)
break;

for(int i = 0;i < n;i++)
{
if(strs[i][len] == strs[0][len])
continue;
else
{
flag = false;
break;
}
}

if(flag == true)
len++;
}

return strs[0].substr(0, len);
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: