find_end,find_first_of

來源:互聯網
上載者:User

直接代碼:

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

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.