add 1343

fishercoder1534 · fishercoder1534 · commit 471510b98d18 · 2020-02-08T09:57:24.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1343|[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | |Medium|Array|
 |1342|[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | |Easy|Bit Manipulation|
 |1341|[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | |Easy||
 |1339|[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1339.java) | |Medium|DP, Tree|
diff --git a/src/main/java/com/fishercoder/solutions/_1343.java b/src/main/java/com/fishercoder/solutions/_1343.java
@@ -0,0 +1,57 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold
+ *
+ * Given an array of integers arr and two integers k and threshold.
+ * Return the number of sub-arrays of size k and average greater than or equal to threshold.
+ *
+ * Example 1:
+ * Input: arr = [2,2,2,2,5,5,5,8], k = 3, threshold = 4
+ * Output: 3
+ * Explanation: Sub-arrays [2,5,5],[5,5,5] and [5,5,8] have averages 4, 5 and 6 respectively. All other sub-arrays of size 3 have averages less than 4 (the threshold).
+ *
+ * Example 2:
+ * Input: arr = [1,1,1,1,1], k = 1, threshold = 0
+ * Output: 5
+ *
+ * Example 3:
+ * Input: arr = [11,13,17,23,29,31,7,5,2,3], k = 3, threshold = 5
+ * Output: 6
+ * Explanation: The first 6 sub-arrays of size 3 have averages greater than 5. Note that averages are not integers.
+ *
+ * Example 4:
+ * Input: arr = [7,7,7,7,7,7,7], k = 7, threshold = 7
+ * Output: 1
+ *
+ * Example 5:
+ * Input: arr = [4,4,4,4], k = 4, threshold = 1
+ * Output: 1
+ *
+ * Constraints:
+ * 1 <= arr.length <= 10^5
+ * 1 <= arr[i] <= 10^4
+ * 1 <= k <= arr.length
+ * 0 <= threshold <= 10^4
+ * */
+public class _1343 {
+    public static class Solution1 {
+        public int numOfSubarrays(int[] arr, int k, int threshold) {
+            int sum = 0;
+            for (int i = 0; i < k - 1; i++) {
+                sum += arr[i];
+            }
+            int count = 0;
+            for (int i = k - 1; i < arr.length; i++) {
+                sum += arr[i];
+                if (i - k >= 0) {
+                    sum -= arr[i - k];
+                }
+                if (sum / k >= threshold) {
+                    count++;
+                }
+            }
+            return count;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1343Test.java b/src/test/java/com/fishercoder/_1343Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1343;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1343Test {
+    private static _1343.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1343.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.numOfSubarrays(new int[]{2, 2, 2, 2, 5, 5, 5, 8}, 3, 4));
+    }
+
+}
