C++ 在容器A中查找最后出现的容器B中的元素，并返回iterator（find_end）

#include <iostream>     // cout
#include <algorithm>    // find_end
#include <vector>       // vector
using namespace std;
bool myfunction (int i, int j) {
  return (i==j);
}

int main () {
  int myints[] = {,,,,,,,,,};
  vector<int> haystack (myints,myints+);

  int needle1[] = {,,};

  // using default comparison:
  vector<int>::iterator it;
  it = find_end (haystack.begin(), haystack.end(), needle1, needle1+);

  if (it!=haystack.end())
    cout << "needle1 last found at position " << (it-haystack.begin()) << '\n';

  int needle2[] = {,,};

  // using predicate comparison:
  it = find_end (haystack.begin(), haystack.end(), needle2, needle2+, myfunction);

  if (it!=haystack.end())
    cout << "needle2 last found at position " << (it-haystack.begin()) << '\n';return ;
}