mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
66 lines
2.8 KiB
HTML
66 lines
2.8 KiB
HTML
|
<p>You are given a 2D<strong> </strong>array <code>points</code> and a string <code>s</code> where, <code>points[i]</code> represents the coordinates of point <code>i</code>, and <code>s[i]</code> represents the <strong>tag</strong> of point <code>i</code>.</p>
|
||
|
|
|
||
|
|
<p>A <strong>valid</strong> square is a square centered at the origin <code>(0, 0)</code>, has edges parallel to the axes, and <strong>does not</strong> contain two points with the same tag.</p>
|
||
|
|
|
||
|
|
<p>Return the <strong>maximum</strong> number of points contained in a <strong>valid</strong> square.</p>
|
||
|
|
|
||
|
|
<p>Note:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>A point is considered to be inside the square if it lies on or within the square's boundaries.</li>
|
||
|
|
<li>The side length of the square can be zero.</li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/03/29/3708-tc1.png" style="width: 303px; height: 303px;" /></p>
|
||
|
|
|
||
|
|
<div class="example-block">
|
||
|
|
<p><strong>Input:</strong> <span class="example-io">points = [[2,2],[-1,-2],[-4,4],[-3,1],[3,-3]], s = "abdca"</span></p>
|
||
|
|
|
||
|
|
<p><strong>Output:</strong> <span class="example-io">2</span></p>
|
||
|
|
|
||
|
|
<p><strong>Explanation:</strong></p>
|
||
|
|
|
||
|
|
<p>The square of side length 4 covers two points <code>points[0]</code> and <code>points[1]</code>.</p>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<p><img alt="" src="https://assets.leetcode.com/uploads/2024/03/29/3708-tc2.png" style="width: 302px; height: 302px;" /></p>
|
||
|
|
|
||
|
|
<div class="example-block">
|
||
|
|
<p><strong>Input:</strong> <span class="example-io">points = [[1,1],[-2,-2],[-2,2]], s = "abb"</span></p>
|
||
|
|
|
||
|
|
<p><strong>Output:</strong> <span class="example-io">1</span></p>
|
||
|
|
|
||
|
|
<p><strong>Explanation:</strong></p>
|
||
|
|
|
||
|
|
<p>The square of side length 2 covers one point, which is <code>points[0]</code>.</p>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 3:</strong></p>
|
||
|
|
|
||
|
|
<div class="example-block">
|
||
|
|
<p><strong>Input:</strong> <span class="example-io">points = [[1,1],[-1,-1],[2,-2]], s = "ccd"</span></p>
|
||
|
|
|
||
|
|
<p><strong>Output:</strong> <span class="example-io">0</span></p>
|
||
|
|
|
||
|
|
<p><strong>Explanation:</strong></p>
|
||
|
|
|
||
|
|
<p>It's impossible to make any valid squares centered at the origin such that it covers only one point among <code>points[0]</code> and <code>points[1]</code>.</p>
|
||
|
|
</div>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= s.length, points.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>points[i].length == 2</code></li>
|
||
|
|
<li><code>-10<sup>9</sup> <= points[i][0], points[i][1] <= 10<sup>9</sup></code></li>
|
||
|
|
<li><code>s.length == points.length</code></li>
|
||
|
|
<li><code>points</code> consists of distinct coordinates.</li>
|
||
|
|
<li><code>s</code> consists only of lowercase English letters.</li>
|
||
|
|
</ul>
|