C++代码实现：求解字符串数组的最长公共前缀

```cpp #include <iostream> #include <cstdlib> #include <string> using namespace std; string longestCommonPrefix(string * strs, int strsSize) { if (strsSize == 0) return ""; string prefix = strs[0]; for (int i = 1; i < strsSize; i++) { while (strs[i].find(prefix) != 0) { prefix = prefix.substr(0, prefix.length() - 1); if (prefix.empty()) return ""; } } return prefix; } ``` ######[AI问答 | 140点数解答 | 2025-11-12 14:50:28]