W3School TIY Editor

#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { vector<string> cars = {"Volvo", "BMW", "Ford", "Ford", "Tesla"}; auto it = adjacent_find(cars.begin(), cars.end()); if (it != cars.end()) { cout << *it << " 连续出现了两次\n"; } else { cout << "没有相邻的重复元素\n"; } return 0; }