迭代器的使用方法简要介绍(摘自C++Primer)
2006-10-15 13:40 ubunoon 阅读(183) 评论(0) 编辑 收藏 举报
代码主要显示了迭代器使用泛型算法
#include <vecotor>
#include <algorithm>
#include <iostream>
int ia[10] = {51,23,7,88,41,98,12,103,37,6};
int main()
{
vector < int > vec( ia, ia+10);
// 排序数组
sort ( vec.begin(), vec.end() ):
// 获取值
int search_value;
cin >> search_value;
// 搜索元素
vector < int > :: iterator found;
found = find ( vec.begin(), vec.end(), search_value);
if ( found != vec.end() )
cout << "search_value not found!\n";
// 反转数组
reverse( vec.begin(), vec.end() );
// ....
}
#include <vecotor>
#include <algorithm>
#include <iostream>
int ia[10] = {51,23,7,88,41,98,12,103,37,6};
int main()
{
vector < int > vec( ia, ia+10);
// 排序数组
sort ( vec.begin(), vec.end() ):
// 获取值
int search_value;
cin >> search_value;
// 搜索元素
vector < int > :: iterator found;
found = find ( vec.begin(), vec.end(), search_value);
if ( found != vec.end() )
cout << "search_value not found!\n";
// 反转数组
reverse( vec.begin(), vec.end() );
// ....
}
/*
*
* Copyright (c) 2011 Ubunoon.
* All rights reserved.
*
* email: netubu#gmail.com replace '#' to '@'
* http://www.cnblogs.com/ubunoon
* 欢迎来邮件定制各类验证码识别,条码识别,图像处理等软件
* 推荐不错的珍珠饰品,欢迎订购 * 宜臣珍珠(淡水好珍珠) */
*
* Copyright (c) 2011 Ubunoon.
* All rights reserved.
*
* email: netubu#gmail.com replace '#' to '@'
* http://www.cnblogs.com/ubunoon
* 欢迎来邮件定制各类验证码识别,条码识别,图像处理等软件
* 推荐不错的珍珠饰品,欢迎订购 * 宜臣珍珠(淡水好珍珠) */