adjacent_find

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
class student{
      public:
      int no;
      string strName;
      student(int no,string strName){
                  this->no=no;
                  this->strName=strName;
                  }
      bool operator==(student &s){
           return(this->no==s.no);
           }            
      };
int main(){
    vector<student>s;
    vector<student>::iterator it;
    student s1(1,"1");
    student s2(2,"2");
    student s3(2,"2");
    student s4(3,"3");
    student s5(4,"4");
    student s6(5,"5");
    student s7(5,"5");
    student s8(6,"6");
    s.push_back(s1);
    s.push_back(s2);
    s.push_back(s3);
    s.push_back(s4);
    s.push_back(s5);
    s.push_back(s6);
    s.push_back(s7);
    s.push_back(s8);
    it=adjacent_find(s.begin(),s.end());
    cout<<(*it).no<<endl;//不能写成*it.no
    it=adjacent_find(++it,s.end());
    cout<<(*it).no<<endl; 
    system("pause");
    
    }

 
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zhongkeli/article/details/6888962
文章标签: iterator string system
个人分类: STL
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭