add 1176

fishercoder1534 · fishercoder1534 · commit 29af2830b42c · 2020-02-04T15:44:28.000-08:00
diff --git a/README.md b/README.md
@@ -51,6 +51,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1185|[Day of the Week](https://leetcode.com/problems/day-of-the-week/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | |Easy||
 |1184|[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI)|Easy||
 |1180|[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1180.java) | |Easy|Math, String|
+|1176|[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1176.java) | |Easy|Array, Sliding Window|
 |1175|[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1175.java) | |Easy||
 |1165|[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | |Easy||
 |1160|[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java)| |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1176.java b/src/main/java/com/fishercoder/solutions/_1176.java
@@ -0,0 +1,63 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1176. Diet Plan Performance
+ *
+ * A dieter consumes calories[i] calories on the i-th day.
+ * Given an integer k, for every consecutive sequence of k days (calories[i], calories[i+1], ..., calories[i+k-1]
+ * for all 0 <= i <= n-k), they look at T, the total calories consumed during that sequence of k days (calories[i] + calories[i+1] + ... + calories[i+k-1]):
+ * If T < lower, they performed poorly on their diet and lose 1 point;
+ * If T > upper, they performed well on their diet and gain 1 point;
+ * Otherwise, they performed normally and there is no change in points.
+ * Initially, the dieter has zero points. Return the total number of points the dieter has after dieting for calories.length days.
+ *
+ * Note that the total points can be negative.
+ *
+ * Example 1:
+ * Input: calories = [1,2,3,4,5], k = 1, lower = 3, upper = 3
+ * Output: 0
+ * Explanation: Since k = 1, we consider each element of the array separately and compare it to lower and upper.
+ * calories[0] and calories[1] are less than lower so 2 points are lost.
+ * calories[3] and calories[4] are greater than upper so 2 points are gained.
+ *
+ * Example 2:
+ * Input: calories = [3,2], k = 2, lower = 0, upper = 1
+ * Output: 1
+ * Explanation: Since k = 2, we consider subarrays of length 2.
+ * calories[0] + calories[1] > upper so 1 point is gained.
+ *
+ * Example 3:
+ * Input: calories = [6,5,0,0], k = 2, lower = 1, upper = 5
+ * Output: 0
+ * Explanation:
+ * calories[0] + calories[1] > upper so 1 point is gained.
+ * lower <= calories[1] + calories[2] <= upper so no change in points.
+ * calories[2] + calories[3] < lower so 1 point is lost.
+ *
+ * Constraints:
+ * 1 <= k <= calories.length <= 10^5
+ * 0 <= calories[i] <= 20000
+ * 0 <= lower <= upper
+ * */
+public class _1176 {
+    public static class Solution1 {
+        public int dietPlanPerformance(int[] calories, int k, int lower, int upper) {
+            int sum = 0;
+            int points = 0;
+            for (int i = 0, j = 0; i <= calories.length - k && j < calories.length; j++) {
+                sum += calories[j];
+                if (j - i > k - 1) {
+                    sum -= calories[i++];
+                }
+                if (j - i == k - 1) {
+                    if (sum > upper) {
+                        points++;
+                    } else if (sum < lower) {
+                        points--;
+                    }
+                }
+            }
+            return points;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1176Test.java b/src/test/java/com/fishercoder/_1176Test.java
@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1176;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+public class _1176Test {
+    private static _1176.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1176.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(0, solution1.dietPlanPerformance(new int[]{1, 2, 3, 4, 5}, 1, 3, 3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1, solution1.dietPlanPerformance(new int[]{3, 2}, 2, 0, 1));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(0, solution1.dietPlanPerformance(new int[]{6, 5, 0, 0}, 2, 1, 5));
+    }
+}
