mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
73 lines
2.3 KiB
HTML
73 lines
2.3 KiB
HTML
<p>给你一个长度为 <code>n</code> 的数组 <code>original</code> 和一个长度为 <code>n x 2</code> 的二维数组 <code>bounds</code>，其中 <code>bounds[i] = [u<sub>i</sub>, v<sub>i</sub>]</code>。</p>
|
|
|
|
<p>你需要找到长度为 <code>n</code> 且满足以下条件的 <strong>可能的 </strong>数组 <code>copy</code> 的数量：</p>
|
|
|
|
<ol>
|
|
<li>对于 <code>1 <= i <= n - 1</code> ，都有 <code>(copy[i] - copy[i - 1]) == (original[i] - original[i - 1])</code> 。</li>
|
|
<li>对于 <code>0 <= i <= n - 1</code> ，都有 <code>u<sub>i</sub> <= copy[i] <= v<sub>i</sub></code><sub> </sub>。</li>
|
|
</ol>
|
|
|
|
<p>返回满足这些条件的数组数目。</p>
|
|
|
|
<p> </p>
|
|
|
|
<p><strong class="example">示例 1</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>输入：</strong><span class="example-io">original = [1,2,3,4], bounds = [[1,2],[2,3],[3,4],[4,5]]</span></p>
|
|
|
|
<p><strong>输出：</strong><span class="example-io">2</span></p>
|
|
|
|
<p><strong>解释：</strong></p>
|
|
|
|
<p>可能的数组为：</p>
|
|
|
|
<ul>
|
|
<li><code>[1, 2, 3, 4]</code></li>
|
|
<li><code>[2, 3, 4, 5]</code></li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p><strong class="example">示例 2</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>输入：</strong><span class="example-io">original = [1,2,3,4], bounds = [[1,10],[2,9],[3,8],[4,7]]</span></p>
|
|
|
|
<p><strong>输出：</strong><span class="example-io">4</span></p>
|
|
|
|
<p><strong>解释：</strong></p>
|
|
|
|
<p>可能的数组为：</p>
|
|
|
|
<ul>
|
|
<li><code>[1, 2, 3, 4]</code></li>
|
|
<li><code>[2, 3, 4, 5]</code></li>
|
|
<li><code>[3, 4, 5, 6]</code></li>
|
|
<li><code>[4, 5, 6, 7]</code></li>
|
|
</ul>
|
|
</div>
|
|
|
|
<p><strong class="example">示例 3</strong></p>
|
|
|
|
<div class="example-block">
|
|
<p><strong>输入：</strong><span class="example-io">original = [1,2,1,2], bounds = [[1,1],[2,3],[3,3],[2,3]]</span></p>
|
|
|
|
<p><strong>输出：</strong><span class="example-io">0</span></p>
|
|
|
|
<p><strong>解释：</strong></p>
|
|
|
|
<p>没有可行的数组。</p>
|
|
</div>
|
|
|
|
<p> </p>
|
|
|
|
<p><b>提示：</b></p>
|
|
|
|
<ul>
|
|
<li><code>2 <= n == original.length <= 10<sup>5</sup></code></li>
|
|
<li><code>1 <= original[i] <= 10<sup>9</sup></code></li>
|
|
<li><code>bounds.length == n</code></li>
|
|
<li><code>bounds[i].length == 2</code></li>
|
|
<li><code>1 <= bounds[i][0] <= bounds[i][1] <= 10<sup>9</sup></code></li>
|
|
</ul>
|