11-01-03-1.cpp

来自「more efftive 代码」· C++ 代码 · 共 15 行

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
  int A[] = {1, 2, 3, 3, 4, 5};
  const int N = sizeof(A) / sizeof(int);
  
  const int* p = adjacent_find(A, A + N);

  if (p != A + N)
    cout << "Duplicate element: " << *p << endl;
}