一、题目描述
回旋镖定义为一组三个点,这些点各不相同且不在一条直线上。
给出平面上三个点组成的列表,判断这些点是否可以构成回旋镖。
示例 1:
输入:[[1,1],[2,3],[3,2]]
输出:true
示例 2:
输入:[[1,1],[2,2],[3,3]]
输出:false
提示:
points.length == 3
points[i].length == 2
0 <= points[i][j] <= 100
二、题解思路
题目意思是要构造一个三角形,即两边之和大于第三边。
三、程序实例
class Solution {
public:
bool isBoomerang(vector<vector<int>>& points) {
double a = sqrt((points[1][1] - points[0][1]) * (points[1][1] - points[0][1]) + \
(points[1][0] - points[0][0]) * (points[1][0] - points[0][0]));
double b = sqrt((points[2][1] - points[0][1]) * (points[2][1] - points[0][1]) + \
(points[2][0] - points[0][0]) * (points[2][0] - points[0][0]));
double c = sqrt((points[2][1] - points[1][1]) * (points[2][1] - points[1][1]) + \
(points[2][0] - points[1][0]) * (points[2][0] - points[1][0]));
//printf("a = %lf, b = %lf, c = %lf\n", a, b, c);
return (a + b <= c || a + c <= b || c + b <= a) ? false : true;
}
};