add 1577

fishercoder1534 · fishercoder1534 · commit d5c2a32d8c04 · 2021-02-21T15:44:00.000-08:00
diff --git a/README.md b/README.md
@@ -85,6 +85,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java) ||Easy|Array|
 |1583|[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java) ||Medium|Array|
 |1582|[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) ||Easy|Array|
+|1577|[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1577.java) ||Medium|HashTable, Math|
 |1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) |[:tv:](https://youtu.be/SJBDLYqrIsM)|Easy|String|
 |1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) ||Medium|Array, Binary Search|
 |1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) ||Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1577.java b/src/main/java/com/fishercoder/solutions/_1577.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _1577 {
+    public static class Solution1 {
+        public int numTriplets(int[] nums1, int[] nums2) {
+            long result = 0;
+            for (long num : nums1) {
+                result += twoProduct(num * num, nums2);
+            }
+            for (long num : nums2) {
+                result += twoProduct(num * num, nums1);
+            }
+            return (int) result;
+        }
+
+        private long twoProduct(long product, int[] nums) {
+            Map<Long, Long> map = new HashMap<>();
+            long count = 0;
+            for (long num : nums) {
+                if (product % num == 0) {
+                    count += map.getOrDefault(product / num, 0l);
+                }
+                map.put(num, map.getOrDefault(num, 0l) + 1);
+            }
+            return count;
+        }
+
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1577Test.java b/src/test/java/com/fishercoder/_1577Test.java
@@ -0,0 +1,51 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1577;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1577Test {
+    private static _1577.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1577.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.numTriplets(new int[]{7, 4}, new int[]{5, 2, 8, 9}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(9, solution1.numTriplets(new int[]{1, 1}, new int[]{1, 1, 1}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(2, solution1.numTriplets(new int[]{7, 7, 8, 3}, new int[]{1, 2, 9, 7}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(0, solution1.numTriplets(new int[]{4, 7, 9, 11, 23}, new int[]{3, 5, 1024, 12, 18}));
+    }
+
+    @Test
+    public void test5() {
+        assertEquals(4, solution1.numTriplets(new int[]{3, 1, 2, 2}, new int[]{1, 3, 4, 4}));
+    }
+
+    @Test
+    public void test6() {
+        assertEquals(5, solution1.numTriplets(new int[]{4, 1, 4, 1, 12}, new int[]{3, 2, 5, 4}));
+    }
+
+    @Test
+    public void test7() {
+        assertEquals(234, solution1.numTriplets(new int[]{14, 1, 1, 12, 7, 12, 10, 4, 11, 10, 5, 2, 5, 14, 7, 9, 10, 13, 15, 6, 9, 12, 6, 12, 4, 10, 9, 12, 11}, new int[]{3, 12, 1, 9, 1, 12, 4, 12, 4, 1, 7, 10, 7, 11, 4, 13, 4, 11, 5, 1, 14, 12, 15, 4, 2, 3, 13, 10, 3, 4}));
+    }
+}
