g1001_1100.s1037_valid_boomerang.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
1037\. Valid Boomerang
Easy
Given an array `points` where points[i] = [xi, yi] 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 <= xi, yi <= 100