Find the last subsequence (which should be the same as the first)
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char** argv)
{
int elems[] = {5, 6, 9, 8, 8, 3};
vector<int> myVector(elems, elems + 6);
vector<int>::const_iterator it, it2;
int sub[] = {8, 3};
it2 = find_end(myVector.begin(), myVector.end(), sub, sub + 2);
if (it != it2) {
cout << "Error: search and find_end found different subsequences "
<< " even though there is only one match.\n";
}
return (0);
}
Related examples in the same category