STL.find用法小结程序示例

其他参考

#include <bits/stdc++.h>
//StL
//#include <algorithm>
 //
 using namespace std;
 void show(vector<int> vi)
 {
 	 	   for(int i:vi) cout<<i<<'\t';
	 	   cout<<'\n';
 	
 }
 void findDeque()
 {
     vector<int>arr = {1,68,515,48,5,5,8,4,48,1,2};
     deque<int>dq(arr.begin(), arr.end());
 
     auto it = find(dq.begin(), dq.end(), 66);
     if (it != dq.end())
         cout << *it << endl;
     else
         cout << "没找到" << endl;
 
     return ;
 }
 
 void findList()
 {
     vector<int>arr = {1,68,515,48,5,5,8,4,48,1,2};
     list<int>lst(arr.begin(), arr.end());
 
     auto it = find(lst.begin(), lst.end(), 66);
     if (it != lst.end())
         cout << *it << endl;
     else
         cout << "没找到" << endl;
 
     return ;
 }
 
 int main(){
 	vector<int> vi={1,22,332,5,112};
 	show(vi);
 	string position="https://blog.csdn.net/CUBE_lotus/article/details/119044709";
 	
 	int beq=position.find('b');
 	cout<<beq<<'\n';
 	
 	int beq5=position.find('b',5);
 	 	cout<<beq5<<'\n';
 	 	
	int beq6=position.find("blog",5);
	 	cout<<beq6<<'\n';
 	
 	//stack和queue和priority_queue  没有迭代器
 	findDeque();
 	findList();
 	cout<<" list 中find使用方法和vector 中的一样"<<'\n';
 	return 0;
 }