https://leetcode.com/problems/longest-common-prefix/description/
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.
代码：
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
int Size = strs.size();
if(Size == 0) return "";
string ans = "";
for(int i = 0; i < strs[0].length(); i ++) {
char c = strs[0][i];
for(int j = 1; j < Size; j ++) {
if(i >= strs[j].length() || strs[j][i] != c)
return ans;
}
ans.push_back(c);
}
return ans;
}
};
#Leetcode# 14. Longest Common Prefix
原文：https://www.cnblogs.com/zlrrrr/p/9898599.html