#include <algorithm>
#include <vector>
#include <iostream>
#include <array>
using namespace std;
template<class ForwardIterator>
inline size_t argmin(ForwardIterator first, ForwardIterator last)
{
return std::distance(first, std::min_element(first, last));
}
template<class ForwardIterator>
inline size_t argmax(ForwardIterator first, ForwardIterator last)
{
return std::distance(first, std::max_element(first, last));
}
int main() {
array<int, 7> numbers{ 2, 4, 8, 0, 6, -1, 3 };
size_t minIndex = argmin(numbers.begin(), numbers.end());
cout << minIndex << '\n';
vector<float> prices = { 12.5f, 8.9f, 100.0f, 24.5f, 30.0f };
size_t maxIndex = argmax(prices.begin(), prices.end());
cout << maxIndex << '\n';
return 0;
}
运行结果:
5
2
即返回的索引值分别为5,2.
参考:https://blog.csdn.net/theonegis/article/details/83036074
原文链接: https://www.cnblogs.com/juluwangshier/p/13346415.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/200644
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!