C++ STL find
find 函数,复杂度O(n)
涉及一些 泛型编程
1 #include <iostream> 2 #include <string.h> 3 #include <string> 4 5 using namespace std; 6 7 template <class iterator, class value> 8 iterator find(iterator first, iterator last,const T& value) 9 { 10 while (first != last && *first!= value) 11 ++first; 12 return first; 13 } 14 15 int main() 16 { 17 int a[1234]; 18 for (int i=1;i<=5;i++) a[i]=i; 19 if (find(a+1,a+6,4)) cout<<"hello"; 20 return 0; 21 }
其中:
template <class iterator, class value>
和
template <typename iterator, typename value>是一样的