【分析】暴力就能过
class Solution {
public int[] countPoints(int[][] points, int[][] queries) {
int j = 0;
int[] ans = new int[queries.length];
for(var q: queries){
for(var p: points){
if((p[0] - q[0]) * (p[0] - q[0]) + (p[1] - q[1]) * (p[1] - q[1]) <= q[2] * q[2]) ans[j]++;
}
j++;
}
return ans;
}
}