C++ search search_n

#include<vector>
#include<iostream>
#include<list>
#include<algorithm>
using namespace std;

int main(){
	vector <int> a;
	for(int i = 0; i < 10; i ++)
		a.push_back( i);
	a.push_back( 9);
	a.push_back( 9);
	
	for(auto i = a.begin(); i != a.end(); i ++)
		cout << *i << ' ';
	cout << endl;
	
	list <int> b;
	for( int i = 4; i <= 8; i ++)
		b.push_back( i);
	
	for(auto i = b.begin(); i != b.end(); i ++)
		cout << *i << ' ';
	cout << endl;
	
	// search( iterator first1, iterator last1, iterator first2, iterator last2)
	auto p = search( a.begin(), a.end(), b.begin(), b.end());
	if( p != a.end()) cout << "sequence b found in position " << distance( a.begin(), p) << endl;
	else cout << "sequence not found" << endl;
	
	cout <<endl;
	
	//search_n ( iterator first, iterator last, n, key)
	auto i = search_n( a.begin(), a.end(), 3, 9);
	if( i != a.end()) cout << "999 found in position " << distance( a.begin(), i);
	else cout << "999 not found" << endl;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值