refactor 713

fishercoder1534 · fishercoder1534 · commit 4c0f6a9cc64d · 2020-09-28T06:38:16.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_713.java b/src/main/java/com/fishercoder/solutions/_713.java
@@ -2,30 +2,6 @@
 
 public class _713 {
     public static class Solution1 {
-        /**
-         * O(n^2) solution, accepted initially, then Leetcode added one test case to fail it.
-         */
-        public int numSubarrayProductLessThanK(int[] nums, int k) {
-            int result = 0;
-            for (int i = 0; i < nums.length; i++) {
-                int product = nums[i];
-                if (product < k) {
-                    result++;
-                    for (int j = i + 1; j < nums.length; j++) {
-                        product *= nums[j];
-                        if (product < k) {
-                            result++;
-                        } else {
-                            break;
-                        }
-                    }
-                }
-            }
-            return result;
-        }
-    }
-
-    public static class Solution2 {
         public int numSubarrayProductLessThanK(int[] nums, int k) {
             if (k < 2) {
                 return 0;
diff --git a/src/test/java/com/fishercoder/_713Test.java b/src/test/java/com/fishercoder/_713Test.java
@@ -8,21 +8,18 @@
 
 public class _713Test {
     private static _713.Solution1 solution1;
-    private static _713.Solution2 solution2;
     private static int[] nums;
     private static int k;
 
     @BeforeClass
     public static void setup() {
-        solution2 = new _713.Solution2();
         solution1 = new _713.Solution1();
     }
 
     @Test
     public void test1() {
         nums = new int[]{1, 2, 3};
         k = 0;
-        assertEquals(0, solution2.numSubarrayProductLessThanK(nums, k));
         assertEquals(0, solution1.numSubarrayProductLessThanK(nums, k));
     }
 
