1
class Solution {
2
  public int[] countPoints(int[][] points, int[][] queries) {
3
    int len = queries.length;
4
    int[] ans = new int[len];
5

6
    for (int i = 0; i < len; i++) {
7
      int count = 0;
8
      int radius2 = queries[i][2] * queries[i][2];
9
      for (int p = 0; p < points.length; p++) {
10
        int[] point = points[p];
11
        if (radius2(point, queries[i]) <= radius2) {
12
          count += 1;
13
        }
14
      }
15
      ans[i] = count;
16
    }
17

18
    return ans;
19
  }
20

21
  private int radius2(int[] point, int[] center) {
22
    int x = point[0] - center[0];
23
    int y = point[1] - center[1];
24
    return x * x + y * y;
25
  }
26
}