add skeleton for 1352

fishercoder1534 · fishercoder1534 · commit ace9fbad488f · 2020-02-15T20:25:56.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1352|[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1352.java) | |Medium|Array, Design|
 |1351|[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1351.java) | |Easy|Array, Binary Search|
 |1349|[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1349.java) | |Hard|Dynamic Programming|
 |1348|[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1348.java) | |Medium|Design|
diff --git a/src/main/java/com/fishercoder/solutions/_1352.java b/src/main/java/com/fishercoder/solutions/_1352.java
@@ -0,0 +1,55 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1352. Product of the Last K Numbers
+ *
+ * Implement the class ProductOfNumbers that supports two methods:
+ * 1. add(int num)
+ * Adds the number num to the back of the current list of numbers.
+ * 2. getProduct(int k)
+ * Returns the product of the last k numbers in the current list.
+ * You can assume that always the current list has at least k numbers.
+ * At any time, the product of any contiguous sequence of numbers will fit into a single 32-bit integer without overflowing.
+ *
+ * Example:
+ * Input
+ * ["ProductOfNumbers","add","add","add","add","add","getProduct","getProduct","getProduct","add","getProduct"]
+ * [[],[3],[0],[2],[5],[4],[2],[3],[4],[8],[2]]
+ * Output
+ * [null,null,null,null,null,null,20,40,0,null,32]
+ * Explanation
+ * ProductOfNumbers productOfNumbers = new ProductOfNumbers();
+ * productOfNumbers.add(3);        // [3]
+ * productOfNumbers.add(0);        // [3,0]
+ * productOfNumbers.add(2);        // [3,0,2]
+ * productOfNumbers.add(5);        // [3,0,2,5]
+ * productOfNumbers.add(4);        // [3,0,2,5,4]
+ * productOfNumbers.getProduct(2); // return 20. The product of the last 2 numbers is 5 * 4 = 20
+ * productOfNumbers.getProduct(3); // return 40. The product of the last 3 numbers is 2 * 5 * 4 = 40
+ * productOfNumbers.getProduct(4); // return 0. The product of the last 4 numbers is 0 * 2 * 5 * 4 = 0
+ * productOfNumbers.add(8);        // [3,0,2,5,4,8]
+ * productOfNumbers.getProduct(2); // return 32. The product of the last 2 numbers is 4 * 8 = 32
+ *
+ * Constraints:
+ * There will be at most 40000 operations considering both add and getProduct.
+ * 0 <= num <= 100
+ * 1 <= k <= 40000
+ * */
+public class _1352 {
+    public static class Solution1 {
+        public static class ProductOfNumbers {
+
+            public ProductOfNumbers() {
+
+            }
+
+            public void add(int num) {
+
+            }
+
+            public int getProduct(int k) {
+                return -1;
+            }
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1352Test.java b/src/test/java/com/fishercoder/_1352Test.java
@@ -0,0 +1,20 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1352;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _1352Test {
+    private static _1352.Solution1.ProductOfNumbers productOfNumbers;
+
+    @BeforeClass
+    public static void setup() {
+        productOfNumbers = new _1352.Solution1.ProductOfNumbers();
+    }
+
+    @Test
+    public void test1() {
+
+    }
+
+}
