mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
1.5 KiB
HTML
41 lines
1.5 KiB
HTML
|
<p>Given an integer array <code>nums</code> <strong>(0-indexed)</strong> and two integers <code>target</code> and <code>start</code>, find an index <code>i</code> such that <code>nums[i] == target</code> and <code>abs(i - start)</code> is <strong>minimized</strong>. Note that <code>abs(x)</code> is the absolute value of <code>x</code>.</p>
|
||
|
|
|
||
|
|
<p>Return <code>abs(i - start)</code>.</p>
|
||
|
|
|
||
|
|
<p>It is <strong>guaranteed</strong> that <code>target</code> exists in <code>nums</code>.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,2,3,4,5], target = 5, start = 3
|
||
|
|
<strong>Output:</strong> 1
|
||
|
|
<strong>Explanation:</strong> nums[4] = 5 is the only value equal to target, so the answer is abs(4 - 3) = 1.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1], target = 1, start = 0
|
||
|
|
<strong>Output:</strong> 0
|
||
|
|
<strong>Explanation:</strong> nums[0] = 1 is the only value equal to target, so the answer is abs(0 - 0) = 0.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 3:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,1,1,1,1,1,1,1,1,1], target = 1, start = 0
|
||
|
|
<strong>Output:</strong> 0
|
||
|
|
<strong>Explanation:</strong> Every value of nums is 1, but nums[0] minimizes abs(i - start), which is abs(0 - 0) = 0.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 1000</code></li>
|
||
|
|
<li><code>1 <= nums[i] <= 10<sup>4</sup></code></li>
|
||
|
|
<li><code>0 <= start < nums.length</code></li>
|
||
|
|
<li><code>target</code> is in <code>nums</code>.</li>
|
||
|
|
</ul>
|