valid-boomerang

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an array <code>points</code> where <code>points[i] = [xi, yi]</code> represents a point on the X-Y plane, return <code>true</code> if these points are a boomerang.

A boomerang is a set of three points that are all distinct and not in a straight line.

&nbsp;
Example 1:
<pre>Input: points = [[1,1],[2,3],[3,2]]
Output: true
</pre>Example 2:
<pre>Input: points = [[1,1],[2,2],[3,3]]
Output: false
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>points.length == 3</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>0 &lt;= xi, yi &lt;= 100</code></li>
</ul>

第 135 场周赛

weekly-contest-135

isBoomerang

中级工程师

Valid Boomerang

Geometry

Array

Math

给定一个数组<meta charset="UTF-8" />&nbsp;<code>points</code>&nbsp;，其中<meta charset="UTF-8" />&nbsp;<code>points[i] = [xi, yi]</code>&nbsp;表示 X-Y 平面上的一个点，如果这些点构成一个&nbsp;回旋镖&nbsp;则返回&nbsp;<code>true</code>&nbsp;。

回旋镖&nbsp;定义为一组三个点，这些点&nbsp;各不相同&nbsp;且&nbsp;不在一条直线上&nbsp;。

&nbsp;

示例 1：

<pre>
输入：points = [[1,1],[2,3],[3,2]]
输出：true
</pre>

示例 2：

<pre>
输入：points = [[1,1],[2,2],[3,3]]
输出：false</pre>

&nbsp;

提示：
<meta charset="UTF-8" />

<ul>
	<li><code>points.length == 3</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>0 &lt;= xi, yi&nbsp;&lt;= 100</code></li>
</ul>