leetcode1037 有效的回旋镖(Java练习)

纯粹水题，纯粹是为了让我从python舒适的语法糖使用体验中调整到Java的一些常用方法；
题目不放了，太简单了。
代码如下

class Solution {
    public boolean isBoomerang(int[][] points) 
    {
        if(points[0][0] == points[1][0]&& points[0][0] == points[2][0] && points[1][0]==points[2][0]) return false;
        if(points[0][1] == points[1][1]&& points[0][1] == points[2][1] && points[1][1]==points[2][1]) return false;
        if (Arrays.equals(points[1],points[0]) || Arrays.equals(points[2],points[0]) || Arrays.equals(points[2],points[1])){
            return false;
        }
        float a = (float)(points[0][0]-points[1][0])/(points[0][1]-points[1][1]);
        float b = (float)(points[0][0] - a*points[0][1]);
        if (a*points[2][1] + b == points[2][0]) return false;
        else return true;
    }
}

转载于:https://www.cnblogs.com/yfc0818/p/11072607.html