Find the first subsequence of two consecutive 8s : vector find « Vector « C++






  1. C++
  2. Vector
  3. vector find

Find the first subsequence of two consecutive 8s

  
#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;  

  it = search_n(myVector.begin(), myVector.end(), 2, 8);
  if (it != myVector.end()) {
    cout << "Found two consecutive 8s starting at position "
   << it - myVector.begin() << endl;
  }

  return (0);
}








Related examples in the same category

1.Locate maximum element in a vector
2.Locate minimum element in a vector
3.Demonstrating the generic find algorithm with a vector
4.Find the min value in the vector
5.Find the max value in the vector
6.Find the first pair of matching consecutive elements
7.Find the first of two values
8.Find the first subsequence
9.Find the last subsequence (which should be the same as the first)
10.Binary search a vector
11.Search the vector for the elements present in the list
12.Returns the positions of all values within a range