coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-29 16:53:13 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (Chinese)/网络信号最好的坐标 [coordinate-with-maximum-network-quality].html
View File

@@ -23,7 +23,7 @@
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<p><strong class="example">示例 1：</strong></p>
<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2020/10/17/untitled-diagram.png" style="width: 176px; height: 176px;" />
<pre>
<b>输入：</b>towers = [[1,2,5],[2,1,7],[3,1,9]], radius = 2
@@ -35,14 +35,14 @@
- 塔 (3, 1) 强度参数为 9 ，在该点强度为 ⌊9 / (1 + sqrt(1)⌋ = ⌊4.5⌋ = 4
没有别的坐标有更大的信号强度。</pre>
<p><strong>示例 2：</strong></p>
<p><strong class="example">示例 2：</strong></p>
<pre>
<b>输入：</b>towers = [[23,11,21]], radius = 9
<b>输出：</b>[23,11]
<strong>解释：</strong>由于仅存在一座信号塔，所以塔的位置信号强度最大。</pre>
<p><strong>示例 3：</strong></p>
<p><strong class="example">示例 3：</strong></p>
<pre>
<b>输入：</b>towers = [[1,2,13],[2,1,7],[0,1,9]], radius = 2