题目：Write a function to find the longest common PRefix string amongst an array of strings
此题比较简单，解题代码如下：
// 时间复杂度 O(n1 + n2 + ...)class Solution {public: string longestCommonPrefix(vector<string>& strs) { if (strs.empty()) return ""; string result; for (int i = 0; i < strs.size(); ++i) { if (i == 0) result = strs[0]; else { string tmp; for (int j = 0; j < result.size() && j < strs[i].size(); ++j) { if (result[j] == strs[i][j]) tmp += result[j]; else break; } result = tmp; } } return result; }};新闻热点
疑难解答
