vector容器本身好像并没有find函数; 你可以使用类属算法中的find函数,记得包括头文件;Illustrates how to use the find Standard Template Library (STL) function in Visual C++.template<class InputIterator, class T> inline InputIterator find( InputIterator First, InputIterator Last, const T& Value )Note The class/parameter names in the prototype do not match the version in the header file. Some have been modified to improve readability.Res The find algorithm locates the first element in the range [First, Last) that matches Value and returns the iterator positioned at the first matching element, or Last + 1 if no such element exists. Example // find.cpp // compile with: /EHsc// disable warning C4786: symbol greater than 255 characters, // okay to ignore #pragma warning(disable: 4786)#include <algorithm> #include <iostream>using namespace std;int main() { const int ARRAY_SIZE = 8 ; int IntArray[ARRAY_SIZE] = { 1, 2, 3, 4, 4, 5, 6, 7 } ; int *location ; // stores the position of the first // matching element. int i ; int value = 4 ; // print content of IntArray cout << "IntArray { " ; for(i = 0; i < ARRAY_SIZE; i++) cout << IntArray[i] << ", " ; cout << " }" << endl ; // Find the first element in the range [first, last + 1) // that matches value. location = find(IntArray, IntArray + ARRAY_SIZE, value) ; //print the matching element if any was found if (location != IntArray + ARRAY_SIZE) // matching element found cout << "First element that matches " << value << " is at location " << location - IntArray << endl; else // no matching element was // found cout << "The sequence does not contain any elements" << " with value " << value << endl ;
你可以使用类属算法中的find函数,记得包括头文件;Illustrates how to use the find Standard Template Library (STL) function in Visual C++.template<class InputIterator, class T> inline
InputIterator find(
InputIterator First,
InputIterator Last,
const T& Value
)Note The class/parameter names in the prototype do not match the version in the header file. Some have been modified to improve readability.Res
The find algorithm locates the first element in the range [First, Last) that matches Value and returns the iterator positioned at the first matching element, or Last + 1 if no such element exists. Example
// find.cpp
// compile with: /EHsc// disable warning C4786: symbol greater than 255 characters,
// okay to ignore
#pragma warning(disable: 4786)#include <algorithm>
#include <iostream>using namespace std;int main()
{
const int ARRAY_SIZE = 8 ;
int IntArray[ARRAY_SIZE] = { 1, 2, 3, 4, 4, 5, 6, 7 } ; int *location ; // stores the position of the first
// matching element. int i ; int value = 4 ; // print content of IntArray
cout << "IntArray { " ;
for(i = 0; i < ARRAY_SIZE; i++)
cout << IntArray[i] << ", " ;
cout << " }" << endl ; // Find the first element in the range [first, last + 1)
// that matches value.
location = find(IntArray, IntArray + ARRAY_SIZE, value) ; //print the matching element if any was found
if (location != IntArray + ARRAY_SIZE) // matching element found
cout << "First element that matches " << value
<< " is at location " << location - IntArray << endl;
else // no matching element was
// found
cout << "The sequence does not contain any elements"
<< " with value " << value << endl ;