题目描述:
leetcode链接
还是比较简单的,看题目给的提示数字不大,可以直接平方,不用开平方进行计算,一些简单的函数实现可以不调用系统自带的函数,尽量使用增强for循环
代码
class Solution {
public int[] countPoints(int[][] points, int[][] queries) {
int[] res = new int[queries.length];
for (int i = 0; i < queries.length; i++) {
int tem = 0;
int x = queries[i][0];
int y = queries[i][1];
int zhijing = queries[i][2] * queries[i][2];
for (int[] point : points) {
int temx = point[0];
int temy = point[1];
if ((temx - x) * (temx - x) + (temy - y) * (temy - y) <= zhijing) {
tem++;
}
}
res[i] = tem;
}
return res;
}
}