LeetCode --- 1037. Valid Boomerang 解题报告
Posted 杨鑫newlfe
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 1037. Valid Boomerang 解题报告相关的知识，希望对你有一定的参考价值。
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 == 3points[i].length == 20 <= xi, yi <= 100
所有代码均可在Github中找到：
以上是关于LeetCode --- 1037. Valid Boomerang 解题报告的主要内容，如果未能解决你的问题，请参考以下文章