mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
68 lines
2.8 KiB
HTML
68 lines
2.8 KiB
HTML
|
<p>给你一个二维数组 <code>points</code> 和一个字符串 <code>s</code> ，其中 <code>points[i]</code> 表示第 <code>i</code> 个点的坐标，<code>s[i]</code> 表示第 <code>i</code> 个点的 <strong>标签</strong> 。</p>
|
|||
|
|
|
|||
|
|
<p>如果一个正方形的中心在 <code>(0, 0)</code> ，所有边都平行于坐标轴，且正方形内 <strong>不</strong> 存在标签相同的两个点，那么我们称这个正方形是 <strong>合法</strong> 的。</p>
|
|||
|
|
|
|||
|
|
<p>请你返回 <strong>合法</strong> 正方形中可以包含的 <strong>最多</strong> 点数。</p>
|
|||
|
|
|
|||
|
|
<p><strong>注意：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>如果一个点位于正方形的边上或者在边以内，则认为该点位于正方形内。</li>
|
|||
|
|
<li>正方形的边长可以为零。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong class="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><span class="example-io"><b>输入：</b>points = [[2,2],[-1,-2],[-4,4],[-3,1],[3,-3]], s = "abdca"</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>2</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p>边长为 4 的正方形包含两个点 <code>points[0]</code> 和 <code>points[1]</code> 。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p><strong class="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><span class="example-io"><b>输入：</b>points = [[1,1],[-2,-2],[-2,2]], s = "abb"</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>1</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p>边长为 2 的正方形包含 1 个点 <code>points[0]</code> 。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>points = [[1,1],[-1,-1],[2,-2]], s = "ccd"</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>0</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<p>任何正方形都无法只包含 <code>points[0]</code> 和 <code>points[1]</code> 中的一个点，所以合法正方形中都不包含任何点。</p>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</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> 中的点坐标互不相同。</li>
|
|||
|
|
<li><code>s</code> 只包含小写英文字母。</li>
|
|||
|
|
</ul>
|