14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string ""
.
Example 1:
Input: ["flower","flow","flight"] Output: "fl"
Example 2:
Input: ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings.
Note:
All given inputs are in lowercase letters a-z
.
这道题提交了很多次才过。主要是遗漏了strs全部为空[]的情况,另外需要验证strs中的某一个[x]长度=0的情况。
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
if(strs.size()==0)return "";
int al = -1;
int t = 0;
string ans = "";
for (int i = 0; i < strs.size()-1; i++)
{
int j = 0;
if((strs[i].length()==0)||(strs[i+1].length()==0))return "//如果没有这句,输入为[]时报错。
while ((j < strs[i].length()) && (j < strs[i + 1].length()))
{
if (strs[i][j] == strs[i + 1][j])j++;
else break;
}
if (al == -1)al = j;
else al = min(al, j);
}
ans = strs[0].substr(0, al);
return ans;
}
};