1828 - Queries on Number of Points Inside a Circle\.

Medium

You are given an array points where <code>pointsi = x_i, y_i</code> is the coordinates of the <code>i^th</code> point on a 2D plane. Multiple points can have the same coordinates.

You are also given an array queries where <code>queriesj = x_j, y_j, r_j</code> describes a circle centered at <code>(x_j, y_j)</code> with a radius of <code>r_j</code>.

For each query queries[j], compute the number of points inside the <code>j^th</code> circle. Points on the border of the circle are considered inside.

Return an array answer, where answer[j] is the answer to the <code>j^th</code> query.

Example 1:

Input: points = \[\[1,3],3,3,5,3,2,2], queries = \[\[2,3,1],4,3,1,1,1,2]

Output: 3,2,2

Explanation: The points and circles are shown above. queries0 is the green circle, queries1 is the red circle, and queries2 is the blue circle.

Example 2:

Input: points = \[\[1,1],2,2,3,3,4,4,5,5], queries = \[\[1,2,2],2,2,2,4,3,2,4,3,3]

Output: 2,3,2,4

Explanation: The points and circles are shown above. queries0 is green, queries1 is red, queries2 is blue, and queries3 is purple.

Constraints:

• 1 <= points.length <= 500

• points[i].length == 2

• <code>0 <= x_i, y_i<= 500</code>

• 1 <= queries.length <= 500

• queries[j].length == 3

• <code>0 <= x_j, y_j<= 500</code>

• <code>1 <= r_j<= 500</code>

• All coordinates are integers.

Follow up: Could you find the answer for each query in better complexity than O(n)?