所以我在LeetCode上解决一个问题，输入:[“flower”，“flow”，“flight”]输出:“fl”。。。 因此，我找到了一个解决方案，并在本地Visual Studio编译器上运行得很好，但当我将其提交到服务器时，服务器抱怨如下消息:“行924:Char 34:runtime error:将未符号偏移量添加到0x603000000a0溢出到0x60300000080(STL_Vector.h)摘要:未定义Behaviorsanitizer:未定义-Behavior/usr/bin/../lib/gcc/x86_64-linux-gnu/8/../../../include/C++/8/bits/stl_Vector.h:933:34”
为了进一步澄清问题，这是LeetCode上的问题链接，最长的常用前缀，我的解决方案是
string longestCommonPrefix(vector<string> strs)
{
string temp;
int count = 0;
int new_count = 0;
string::iterator iter1;
string::iterator iter2;
for (int i = 0; i != strs.size(); ++i) {
if (i != str.size() - 1) {
cout << "if 1\n";
iter1 = strs[i].begin();
iter2 = strs[i + 1].begin();
while (iter1 != str[i].end() && iter2 != str[i + 1].end()) {
if (*iter1 == *iter2 ) {
temp.push_back(*iter1);
++count;
}
if (*iter1 != *iter2)
break;
++iter1;
++iter2;
}
}
if (i == str.size() - 1) {
iter1 = strs[i].begin();
iter2 = strs[i - 1].begin();
while (iter1 != str[i].end() && iter2 != str[i - 1].end()) {
if (*iter1 == *iter2 ) {
temp.push_back(*iter1);
++new_count;
}
if (*iter1 != *iter2)
break;
++iter1;
++iter2;
}
break;
}
i += 1;
}
new_count = min(count, new_count);
if ( new_count == 0) {
return "";
}
temp = string(temp.substr(0, new_count));
return temp;
}
这将通过，但不确定是否存在bug:
#include <cstdint>
#include <string>
struct Solution {
static std::string longestCommonPrefix(
const std::vector<std::string>& strs
) {
std::string longest = "";
for (std::size_t letter = 0; std::size(strs) > 0; longest += strs[0][letter], ++letter) {
for (std::size_t word = 0; word < std::size(strs); ++word) {
if (
letter >= std::size(strs[word]) ||
(word > 0 && strs[word][letter] != strs[word - 1][letter])
) {
return longest;
}
}
}
return longest;
}
};
