g1001_1100.s1037_valid_boomerang.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g1001_1100.s1037_valid_boomerang;

// #Easy #Array #Math #Geometry #2022_02_27_Time_0_ms_(100.00%)_Space_41.7_MB_(21.15%)

/**
 * 1037 - Valid Boomerang\.
 *
 * Easy
 *
 * Given an array `points` where points[i] = [x_i, y_i] represents a point on the **X-Y** plane, return `true` _if these points are a **boomerang**_.
 *
 * A **boomerang** is a set of three points that are **all distinct** and **not in a straight line**.
 *
 * **Example 1:**
 *
 * **Input:** points = \[\[1,1],[2,3],[3,2]]
 *
 * **Output:** true
 *
 * **Example 2:**
 *
 * **Input:** points = \[\[1,1],[2,2],[3,3]]
 *
 * **Output:** false
 *
 * **Constraints:**
 *
 * *   `points.length == 3`
 * *   `points[i].length == 2`
 * *   0 <= x_i, y_i <= 100
**/
public class Solution {
    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]);
    }
}