class { public: stringlongestCommonPrefix(vector<string>& strs){ if (strs.size() == 0) return""; int minlen = INT_MAX; string res = ""; for (int i = 0; i < strs.size(); i++) { if (strs[i].size() < minlen) minlen = strs[i].size(); } for (int i = 0; i < minlen; i++) { bool flag = true; for (int j = 0; j < strs.size() - 1; j++) { if (strs[j][i] != strs[j + 1][i]) flag = false; } if (flag == true) res = res + strs[0][i]; else break; } return res; } };
近期评论