reverse_iterator

#include <iostream>
#include <vector>
#include <time.h>
int main(int argc, char ** argv)
{
    std::vector<int> vec;
    int _data = 0;
    srand(time(NULL));
    for (int i = 0; i < 10; ++i)
    {
        vec.push_back(rand() % 100);
    }
    for (std::vector<int>::iterator iter = std::begin(vec);iter != std::end(vec);++iter)
    {
        std::cout << *iter << " ";
    }
    std::cout << std::endl;

    std::cout << "input you want find data : ";
    std::cin >> _data;

    auto result = std::find(std::begin(vec), std::end(vec), _data);
    if (result != std::end(vec))
    {
        std::cout << "find this data and the position is : " << result - std::begin(vec) << std::endl;
    }
    else
    {
        std::cout << "no find !" << std::endl;
    }

    //revser_iterator,如果是用std::begin()他就会报错
    for (std::vector<int>::reverse_iterator reiter = std::rbegin(vec); reiter != std::rend(vec); ++reiter)
    {
        std::cout << *reiter << " ";
    }
    std::cout << std::endl;
    auto result1 = std::find(std::rbegin(vec), std::rend(vec), _data);
    if (result1 != std::rend(vec))
    {
        std::cout << "find this data and the position is : " << result1.base()-std::begin(vec) - 1 << std::endl;

    }

    return 0;
}