14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
class Solution {
2
public:
3
string longestCommonPrefix(vector<string>& strs) {
4
if (strs.size() == 0) return "";
5
string s(strs[0]);
6
for (int i = 0; i < strs.size(); i++) {
7
string temp;
8
for (int j = 0; j < s.length() && j < strs[i].length(); j++)
9
if (s[j] == strs[i][j]) temp += s[j];
10
else break;
11
s = temp;
12
}
13
return s;
14
}
15
};