add 1037

Author: fishercoder1534

README.md

@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1037|[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) | O(1) | O(1) | |Easy|Math|
 |1033|[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | O(1) | O(1) | |Easy|Math|
 |1030|[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) | O(R*C) | O(1) | |Easy|
 |1022|[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) | O(n) | O(n) | |Easy|

src/main/java/com/fishercoder/solutions/_1037.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1037. Valid Boomerang
+ *
+ * A boomerang is a set of 3 points that are all distinct and not in a straight line.
+ *
+ * Given a list of three points in the plane, return whether these points are a boomerang.
+ *
+ * Example 1:
+ * Input: [[1,1],[2,3],[3,2]]
+ * Output: true
+ *
+ * Example 2:
+ * Input: [[1,1],[2,2],[3,3]]
+ * Output: false
+ *
+ * Note:
+ * points.length == 3
+ * points[i].length == 2
+ * 0 <= points[i][j] <= 100
+ * */
+public class _1037 {
+    public static class Solution1 {
+        public boolean isBoomerang(int[][] points) {
+            return (points[1][1] - points[0][1]) * (points[2][0] - points[0][0]) != (points[2][1] - points[0][1]) * (points[1][0] - points[0][0]);
+        }
+    }
+}

src/test/java/com/fishercoder/_1037Test.java

@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1037;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+public class _1037Test {
+    private static _1037.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1037.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.isBoomerang(new int[][]{new int[]{1, 1}, new int[]{2, 3}, new int[]{3, 2}}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(false, solution1.isBoomerang(new int[][]{new int[]{1, 1}, new int[]{2, 2}, new int[]{3, 3}}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(true, solution1.isBoomerang(new int[][]{new int[]{0, 0}, new int[]{0, 2}, new int[]{2, 1}}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(false, solution1.isBoomerang(new int[][]{new int[]{0, 0}, new int[]{1, 1}, new int[]{1, 1}}));
+    }
+
+}