Leetcode 346. Moving Average from Data Stream (Easy) (cpp)

原创于 2016-12-14 04:16:05 发布 · 461 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #cpp

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Design

9 篇文章

订阅专栏

本文介绍了一个简单有效的滑动窗口平均值计算方法。通过使用双端队列和累加求和的方式，能够高效地计算出给定窗口大小内整数流的移动平均值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Leetcode 346. Moving Average from Data Stream (Easy) (cpp)

Tag: Design, Queue

Difficulty: Easy

/*

346. Moving Average from Data Stream (Easy)

Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window.

For example,
MovingAverage m = new MovingAverage(3);
m.next(1) = 1
m.next(10) = (1 + 10) / 2
m.next(3) = (1 + 10 + 3) / 3
m.next(5) = (10 + 3 + 5) / 3

*/
class MovingAverage {
public:
	/** Initialize your data structure here. */
	int _size = 0, sum = 0;
	deque<int> d;
	MovingAverage(int size) {
		_size = size;
	}

	double next(int val) {
		while (d.size() >= _size) {
			sum -= d.front();
			d.pop_front();
		}
		sum += val;
		d.push_back(val);
		return (double)sum / d.size();
	}
};
/**
* Your MovingAverage object will be instantiated and called as such:
* MovingAverage obj = new MovingAverage(size);
* double param_1 = obj.next(val);
*/