Longest substrings without repeating characters: Difference between revisions
Content added Content deleted
(Added C++ solution) |
m (Simplified C++ code) |
||
Line 19: | Line 19: | ||
std::vector<std::string> longest_substrings_without_repeats(const std::string& str) { |
std::vector<std::string> longest_substrings_without_repeats(const std::string& str) { |
||
size_t max_length = 0; |
size_t max_length = 0; |
||
std::vector< |
std::vector<std::string> result; |
||
size_t length = str.size(); |
size_t length = str.size(); |
||
for (size_t offset = 0; offset < length; ++offset) { |
for (size_t offset = 0; offset < length; ++offset) { |
||
Line 30: | Line 30: | ||
} |
} |
||
if (len > max_length) { |
if (len > max_length) { |
||
result.clear(); |
|||
max_length = len; |
max_length = len; |
||
} |
} |
||
if (len == max_length) |
if (len == max_length) |
||
result.push_back(str.substr(offset, max_length)); |
|||
} |
} |
||
std::vector<std::string> result; |
|||
for (size_t offset : offsets) |
|||
result.push_back(str.substr(offset, max_length)); |
|||
return result; |
return result; |
||
} |
} |