add Java solution for 1658

fishercoder1534 · fishercoder1534 · commit f7b7d3765453 · 2021-01-14T17:09:51.000-08:00
diff --git a/README.md b/README.md
@@ -32,7 +32,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1664|[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)|[Javascript](./javascript/_1664.js) ||Medium|Greedy|
 |1663|[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) ||Medium|Greedy|
 |1662|[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) ||Easy|String|
-|1658|[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)|[Javascript](./javascript/_1658.js)||Medium|Greedy|
+|1658|[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)|[Javascript](./javascript/_1658.js) | [Java](../master/src/main/java/com/fishercoder/solutions/_1658.java)||Medium|Greedy|
 |1657|[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) |[:tv:](https://youtu.be/-jXQK-UeChU)|Medium|Greedy|
 |1656|[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) ||Easy|Array, Design|
 |1652|[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) ||Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1658.java b/src/main/java/com/fishercoder/solutions/_1658.java
@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+public class _1658 {
+    public static class Solution1 {
+        /**
+         * credit: https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/discuss/936074/JavaPython-3-Sliding-window%3A-Longest-subarray-sum-to-the-target-sum(nums)-x.
+         */
+        public int minOperations(int[] nums, int x) {
+            int sum = 0;
+            for (int n : nums) {
+                sum += n;
+            }
+            int target = sum - x;
+            int len = nums.length;
+            int size = Integer.MIN_VALUE;
+            for (int left = -1, right = 0, windowSum = 0; right < len; right++) {
+                windowSum += nums[right];
+                while (left + 1 < len && windowSum > target) {
+                    left++;
+                    windowSum -= nums[left];
+                }
+                if (windowSum == target) {
+                    size = Math.max(size, right - left);
+                }
+            }
+            return size < 0 ? -1 : len - size;
+        }
+
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1658Test.java b/src/test/java/com/fishercoder/_1658Test.java
@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1658;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1658Test {
+    private static _1658.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1658.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.minOperations(new int[]{1, 1, 4, 2, 3}, 5));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(-1, solution1.minOperations(new int[]{5, 6, 7, 8, 9}, 4));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(5, solution1.minOperations(new int[]{3, 2, 20, 1, 1, 3}, 10));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(16, solution1.minOperations(new int[]{8828, 9581, 49, 9818, 9974, 9869, 9991, 10000, 10000, 10000, 9999, 9993, 9904, 8819, 1231, 6309}, 134365));
+    }
+
+}
