count-lattice-points-inside-a-circle

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given a 2D integer array <code>circles</code> where <code>circles[i] = [xi, yi, ri]</code> represents the center <code>(xi, yi)</code> and radius <code>ri</code> of the <code>ith</code> circle drawn on a grid, return the number of lattice points that are present inside at least one circle.

Note:

<ul>
	<li>A lattice point is a point with integer coordinates.</li>
	<li>Points that lie on the circumference of a circle are also considered to be inside it.</li>
</ul>

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/exa-11.png" style="width: 300px; height: 300px;" />
<pre>
Input: circles = [[2,2,1]]
Output: 5
Explanation:
The figure above shows the given circle.
The lattice points present inside the circle are (1, 2), (2, 1), (2, 2), (2, 3), and (3, 2) and are shown in green.
Other points such as (1, 1) and (1, 3), which are shown in red, are not considered inside the circle.
Hence, the number of lattice points present inside at least one circle is 5.</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/exa-22.png" style="width: 300px; height: 300px;" />
<pre>
Input: circles = [[2,2,2],[3,4,1]]
Output: 16
Explanation:
The figure above shows the given circles.
There are exactly 16 lattice points which are present inside at least one circle. 
Some of them are (0, 2), (2, 0), (2, 4), (3, 2), and (4, 4).
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= circles.length &lt;= 200</code></li>
	<li><code>circles[i].length == 3</code></li>
	<li><code>1 &lt;= xi, yi &lt;= 100</code></li>
	<li><code>1 &lt;= ri &lt;= min(xi, yi)</code></li>
</ul>