edit 346

fishercoder1534 · fishercoder1534 · commit 636640c57b40 · 2017-07-24T18:30:23.000-07:00
diff --git a/README.md b/README.md
@@ -245,7 +245,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/IntersectionOfTwoArrays.java)| O(m+n)|O(min(m,n)) | Easy| Two Pointers, Binary Search
 |348|[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_348.java)| O(1)|O(n) | Medium| Design 
 |347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_347.java)| O(n)|O(1) | Medium| HashTable, Heap
-|346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MovingAveragefromDataStream.java)| O(1)|O(w)) | Easy| Queue
+|346|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_346.java)| O(1)|O(w)) | Easy| Queue
 |344|[Reverse String](https://leetcode.com/problems/reverse-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) | O(n) |O(1) | Easy | String
 |343|[Integer Break](https://leetcode.com/problems/integer-break/)|[Solution](../master/src/main/java/com/fishercoder/solutions/IntegerBreak.java)| O(1)|O(1) | Medium| Math
 |341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_341.java)| O(n)|O(n) | Medium| Stack
diff --git a/src/main/java/com/fishercoder/solutions/MovingAveragefromDataStream.java b/src/main/java/com/fishercoder/solutions/MovingAveragefromDataStream.java
diff --git a/src/main/java/com/fishercoder/solutions/_346.java b/src/main/java/com/fishercoder/solutions/_346.java
@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+import java.util.LinkedList;
+import java.util.Queue;
+
+/**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
+ */
+public class _346 {
+
+    class MovingAverage {
+
+        private Queue<Integer> q;
+        private Long sum;
+        private int max;
+
+        /**
+         * Initialize your data structure here.
+         */
+        public MovingAverage(int size) {
+            q = new LinkedList();
+            sum = 0l;
+            max = size;
+        }
+
+        public double next(int val) {
+            if (q.size() < max) {
+                q.offer(val);
+                sum += val;
+                return (double) sum / q.size();
+            } else {
+                int first = q.poll();
+                sum -= first;
+                q.offer(val);
+                sum += val;
+                return (double) sum / q.size();
+            }
+        }
+    }
+}
