数组、哈希与双指针：重复工作从哪里删掉

#include <iostream>
#include <optional>
#include <span>
#include <unordered_map>
#include <utility>
#include <vector>
std::optional<std::pair<std::size_t, std::size_t>> two_sum(std::span<const int> data, int target) {
    std::unordered_map<long long, std::size_t> seen;
    for (std::size_t i = 0; i < data.size(); ++i) {
        const long long needed = static_cast<long long>(target) - data[i];
        if (const auto it = seen.find(needed); it != seen.end()) return std::pair{it->second, i};
        seen.try_emplace(data[i], i);
    }
    return std::nullopt;
}
int main() {
    const std::vector<int> a{2, 7, 11}, duplicate{3, 3}, single{3}, none{1, 2};
    const auto result = two_sum(a, 9);
    if (!result || !two_sum(duplicate, 6) || two_sum(single, 6) || two_sum(none, 8)) return 1;
    std::cout << "indices=" << result->first << ',' << result->second << '\n';
}

#include <algorithm>
#include <iostream>
#include <string_view>
#include <unordered_map>
std::size_t longest_unique(std::string_view text) {
    std::unordered_map<char, std::size_t> last;
    std::size_t left = 0, best = 0;
    for (std::size_t right = 0; right < text.size(); ++right) {
        if (const auto it = last.find(text[right]); it != last.end())
            left = std::max(left, it->second + 1);
        last[text[right]] = right;
        best = std::max(best, right - left + 1);
    }
    return best;
}
int main() {
    if (longest_unique("abba") != 2 || longest_unique("") != 0 ||
        longest_unique("aaaa") != 1 || longest_unique("abc") != 3) return 1;
    std::cout << "abba=" << longest_unique("abba") << " empty=" << longest_unique("") << '\n';
}