LeetCode Solutions
1037. Valid Boomerang
Time: Space:
class Solution {
public:
bool isBoomerang(vector<vector<int>>& points) {
return (points[1][0] - points[0][0]) * (points[2][1] - points[1][1]) !=
(points[1][1] - points[0][1]) * (points[2][0] - points[1][0]);
}
};
class Solution {
public boolean isBoomerang(int[][] points) {
return (points[1][0] - points[0][0]) * (points[2][1] - points[1][1]) !=
(points[1][1] - points[0][1]) * (points[2][0] - points[1][0]);
}
}
class Solution:
def isBoomerang(self, points: List[List[int]]) -> bool:
return (points[1][0] - points[0][0]) * (points[2][1] - points[1][1]) != \
(points[1][1] - points[0][1]) * (points[2][0] - points[1][0])