find_end,find_first_of

97 篇文章 0 订阅
92 篇文章 0 订阅

直接代码:

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

int main(){
	int a[]={1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10};
	vector<int>v(a,a+20);
	vector<int>vv(a+3,a+8);
	vector<int>::iterator end=v.end();
	vector<int>::iterator it;
	it=find_end(v.begin(),v.end(),vv.begin(),vv.end());
	while(it!=end){
		cout<<"found "<<distance(v.begin(),it)<<endl;
		end=it;
		it=find_end(v.begin(),end,vv.begin(),vv.end());
	}
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
	int a[]={1,2,3,4,5,6,7,8,9,10};
	vector<int>v(a,a+10);
	vector<int>vv(a+3,a+8);

	vector<int>::iterator it=find_first_of(v.begin(),v.end(),vv.begin(),vv.end());
	//cout<<distance(v.begin(),it)<<endl;
	//cout<<*it<<endl;
	while(it!=v.end()){
		cout<<"found"<<distance(v.begin(),it)<<endl;
		++it;
		it=find_first_of(it,v.end(),vv.begin(),vv.end());
	}
	system("pause");
	return 0;
}

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>
bool chenger(int a,int b){
	return a*2==b;
}
using namespace std;
int main(){
	int a[]={1,2,3,4,5,6,7,8,9,10};
	vector<int>v(a,a+10);
	vector<int>vv(a+3,a+8);
	for(vector<int>::iterator ite=vv.begin();ite!=vv.end();++ite){
		cout<<*ite<<" ";
	}
	cout<<endl;
	vector<int>::iterator it=find_first_of(v.begin(),v.end(),vv.begin(),vv.end(),chenger);
	cout<<*it<<endl;
	system("pause");
	return 0;
}
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<functional>

using namespace std;
int main(){
	int a[]={1,2,3,4,5,6,7,8,9,10};
	vector<int>v(a,a+10);
	vector<int>vv(a+3,a+8);
	
	vector<int>::iterator first;
	vector<int>::reverse_iterator last;
	first=find_first_of(v.begin(),v.end(),vv.begin(),vv.end());
	last=find_first_of(v.rbegin(),v.rend(),vv.begin(),vv.end());
	cout<<"the first location: "<<distance(v.begin(),first)<<endl;
	cout<<"the last locatioin: "<<distance(v.begin(),last.base())<<endl;
	system("pause");
	return 0;
}


 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值