环形缓冲区写入函数
const int bufferSize = 10; //缓冲区大小
int buffer[bufferSize]; //缓冲区
int index; //缓冲区索引
const int sample_pin = A1; //模拟读取引脚
//加入缓冲区
void addReading(int reading)
{
buffer[index] = reading;
index++;
if( index >= bufferSzie)
index = 0;
}
//计算均值
int average(){
long sum = 0;
for( int i = 0; i < bufferSize; i++){
sum += buffer[i];
}
return (int)(sum/bufferSize);
}
void setup() {
// put your setup code here, to run once:
Serial.begin(9600);
}
void loop() {
// put your main code here, to run repeatedly:
int reading = anlongRead(samplePin);
addReading(reading);
Serial.printIn(average());
delay(100);
}
特此记录
anlog
2025年11月1日
515

被折叠的 条评论
为什么被折叠?



