使用元编程 stl算法库和自定义函数实现求整数序列最大值
#include <stdint.h>
#include <iostream>
#include <vector>
#include <type_traits>
#include <algorithm>
using namespace std;
template <int arg, int... rest>
struct integer_max;
template <int arg>
struct integer_max<arg> : std::integral_constant<int, arg> {
};
template <int arg1, int arg2, int... rest>
struct integer_max<arg1, arg2, rest...> : std::integral_constant<int, arg1 >= arg2 ? integer_max<arg1, rest...>::value :
integer_max<arg2, rest...>::value> {
};
int max_value0(const vector<int>&v) {
return *max_element(begin(v), end(v));
}
int max_value1(const vector<int>&v) {
int max = v[0];
int size = v.size();
for (int i = 1;i < size;i++) {
if (max < v[i]) {
max = v[i];
}
}
return max;
}
int main() {
vector<int>v{2, 5, 1, 7, 3};
//cout << integer_max<2, 5, 1, 7, 3>::value << endl;
//cout << max_value0(v) << endl;
//cout << max_value1(v) << endl;
for (int i = 0;i < 1000000;i++) {
//integer_max<2, 5, 1, 7, 3>::value; // 0.010s
//max_value0(v); // 0.107s
max_value1(v); // 0.045s
}
return 0;
}