FilesExpand file tree

 master

/

moving_average.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (24 loc) · 749 Bytes

 master

/

moving_average.py

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (24 loc) · 749 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

from __future__ import division

from collections import deque

class MovingAverage(object):

def __init__(self, size):

"""

Initialize your data structure here.

:type size: int

"""

self.queue = deque(maxlen=size)

def next(self, val):

"""

:type val: int

:rtype: float

"""

self.queue.append(val)

return sum(self.queue) / len(self.queue)

# Given a stream of integers and a window size,

# calculate the moving average of all integers in the sliding window.

if __name__ == '__main__':

m = MovingAverage(3)

assert m.next(1) == 1

assert m.next(10) == (1 + 10) / 2

assert m.next(3) == (1 + 10 + 3) / 3

assert m.next(5) == (10 + 3 + 5) / 3