提交 57747878 编写于 作者: 邹晓航

删除重复定义的算法find

上级 a3281b8e
......@@ -41,16 +41,6 @@ namespace TinySTL{
memset(first, static_cast<unsigned char>(value), n * sizeof(wchar_t));
return first + n;
}
//************ [find] ****************
//********* [Algorithm Complexity: O(N)] ****************
template<class InputIterator, class T>
InputIterator find(InputIterator first, InputIterator last, const T& val){
for (; first != last; ++first){
if (*first == val)
break;
}
return first;
}
//*********** [min] ********************
//********* [Algorithm Complexity: O(1)] ****************
template <class T>
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册