int look_up_table(const int* arr, int size, int target) {
int begin = 0;
int end = size - 1;
int middle;
int result = -1;
while (begin <= end) {
middle = (begin + end) / 2;
// 找到目标元素等于arr[middle]
if (arr[middle] == target) {
return middle;
}
// 目标元素小于arr[middle],在左侧继续查找
else if (target < arr[middle]) {
end = middle - 1;
}
// 目标元素大于arr[middle],在右侧继续查找
else {
result = middle;
begin = middle + 1;
}
}
return result;
}
int ratioDifference(int num1, int num2, int ratio)
{
int difference = (num1 > num2) ? (num1 - num2):(num2 - num1);
int result = (difference * ratio) / 10; // 将差值乘以比例,再除以10,得到整数结果
return result;
}
NTC查表法主要函数,精确到0.1度
最新推荐文章于 2024-02-02 16:43:28 发布