refactor 346

fishercoder1534 · fishercoder1534 · commit 7282931d4099 · 2019-01-18T07:27:48.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_346.java b/src/main/java/com/fishercoder/solutions/_346.java
@@ -3,7 +3,10 @@
 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.
+/**
+ * 346. Moving Average from Data Stream
+ *
+ * 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);
@@ -14,33 +17,35 @@
  */
 public class _346 {
 
-    class MovingAverage {
+    public static class Solution1 {
+        class MovingAverage {
 
-        private Queue<Integer> q;
-        private Long sum;
-        private int max;
+            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;
-        }
+            /**
+             * 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();
+            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();
+                }
             }
         }
     }
-}
+}
