Package g1801_1900.s1848_minimum_distance_to_the_target_element

Class Solution

java.lang.Object

g1801_1900.s1848_minimum_distance_to_the_target_element.Solution

public class Solution
extends Object

1848 - Minimum Distance to the Target Element.<p>Easy</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4,5], target = 5, start = 3</p> <p><strong>Output:</strong> 1</p> <p><strong>Explanation:</strong> nums[4] = 5 is the only value equal to target, so the answer is abs(4 - 3) = 1.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1], target = 1, start = 0</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> nums[0] = 1 is the only value equal to target, so the answer is abs(0 - 0) = 0.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,1,1,1,1,1,1,1,1,1], target = 1, start = 0</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> Every value of nums is 1, but nums[0] minimizes abs(i - start), which is abs(0 - 0) = 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 1000</code></li> <li><code>1 <= nums[i] <= 10⁴</code></li> <li><code>0 <= start < nums.length</code></li> <li><code>target</code> is in <code>nums</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	getMinDistance(int[] nums, int target, int start)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

getMinDistance

public int getMinDistance(int[] nums,
 int target,
 int start)