Leetcode-5051 Valid Boomerang(有效的回旋镖)

class Solution
{
    public:
        bool isBoomerang(vector<vector<int>>& points)
        {
            if(points[0][0] == points[1][0] && points[0][1] == points[1][1]
              || points[1][0] == points[2][0] && points[1][1] == points[2][1]
              ||points[0][0] == points[2][0] && points[0][1] == points[2][1]
              || points[0][0] == points[1][0] && points[1][0] == points[2][0]
              || points[0][1] == points[1][1] && points[1][1] == points[2][1])
            return false;
            double a = (double)(points[0][0] - points[1][0]) / (points[0][1] - points[1][1]);
            double b = (double)(points[1][0] - points[2][0]) / (points[1][1] - points[2][1]);
            double c = (double)(points[0][0] - points[2][0]) / (points[0][1] - points[2][1]);

            if(abs(a-b)<1e-3 && abs(a-c)<1e-3)
                return false;
            return true;
        }
};

也不知道在写什么，加特判加一堆，还好过了