Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g1001_1100.s1037_valid_boomerang.Solution

```
public class Solution
extends Object
```
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

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean isBoomerang(int[][] points)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

isBoomerang

public boolean isBoomerang(int[][] points)