1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
Files
leetcode-problemset/leetcode-cn/problem (Chinese)/好数字之和 [sum-of-good-numbers].html
2025-02-22 16:46:22 +08:00

40 lines
1.6 KiB
HTML
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<p>给定一个整数数组 <code>nums</code> 和一个整数 <code>k</code>,如果元素 <code>nums[i]</code> <strong>严格</strong> 大于下标&nbsp;<code>i - k</code><code>i + k</code> 处的元素(如果这些元素存在),则该元素 <code>nums[i]</code> 被认为是 <strong></strong> 的。如果这两个下标都不存在,那么 <code>nums[i]</code> 仍然被认为是 <strong></strong> 的。</p>
<p>返回数组中所有 <strong></strong> 元素的 <strong></strong></p>
<p>&nbsp;</p>
<p><strong class="example">示例 1</strong></p>
<div class="example-block">
<p><strong>输入:</strong> <span class="example-io">nums = [1,3,2,1,5,4], k = 2</span></p>
<p><strong>输出:</strong> <span class="example-io">12</span></p>
<p><strong>解释:</strong></p>
<p>好的数字包括&nbsp;<code>nums[1] = 3</code><code>nums[4] = 5</code><code>nums[5] = 4</code>,因为它们严格大于下标&nbsp;<code>i - k</code><code>i + k</code> 处的数字。</p>
</div>
<p><strong class="example">示例 2</strong></p>
<div class="example-block">
<p><strong>输入:</strong> <span class="example-io">nums = [2,1], k = 1</span></p>
<p><strong>输出:</strong> <span class="example-io">2</span></p>
<p><strong>解释:</strong></p>
<p>唯一的好数字是 <code>nums[0] = 2</code>,因为它严格大于 <code>nums[1]</code></p>
</div>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>2 &lt;= nums.length &lt;= 100</code></li>
<li><code>1 &lt;= nums[i] &lt;= 1000</code></li>
<li><code>1 &lt;= k &lt;= floor(nums.length / 2)</code></li>
</ul>