#include <iostream> #include <cassert> #include <deque> #include <algorithm> // For find using namespace std; int main() { int x[5] = {1, 2, 3, 4, 5}; deque<int> deque1(&x[0], &x[5]); // Search for the first occurrence deque<int>::iterator where = find(deque1.begin(), deque1.end(), 1); cout << *where << endl; return 0; }
1