【leetcode】1037. Valid Boomerang

题目如下：

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

Given a list of three points in the plane, return whether these points are a boomerang.

 

Example 1:

Input: [[1,1],[2,3],[3,2]]
Output: true

Example 2:

Input: [[1,1],[2,2],[3,3]]
Output: false

 

Note:

1. points.length == 3
2. points[i].length == 2
3. 0 <= points[i][j] <= 100

解题思路：本题就是判断三点是否在一条直线上，判断的方法也很简单，任意从这三个点中选取两组点对，如果这两组的点对的斜率相同，则在同一直线上。

代码如下：

class Solution(object):
    def isBoomerang(self, points):
        """
        :type points: List[List[int]]
        :rtype: bool
        """
        return (points[0][1]-points[1][1]) * (points[1][0]-points[2][0])                != (points[0][0]-points[1][0]) * (points[1][1]-points[2][1])

【leetcode】1037. Valid Boomerang

原文：https://www.cnblogs.com/seyjs/p/10824004.html