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]);
        }
    }
}

@@ -33,440 +33,8 @@
 s;%0A%0A
-/**%0A * 1037. Valid Boomerang%0A *%0A * A boomerang is a set of 3 points that are all distinct and not in a straight line.%0A *%0A * Given a list of three points in the plane, return whether these points are a boomerang.%0A *%0A * Example 1:%0A * Input: %5B%5B1,1%5D,%5B2,3%5D,%5B3,2%5D%5D%0A * Output: true%0A *%0A * Example 2:%0A * Input: %5B%5B1,1%5D,%5B2,2%5D,%5B3,3%5D%5D%0A * Output: false%0A *%0A * Note:%0A * points.length == 3%0A * points%5Bi%5D.length == 2%0A * 0 %3C= points%5Bi%5D%5Bj%5D %3C= 100%0A * */%0A
 publ

refactor 1037