Package g1801_1900.s1848_minimum_distance_to_the_target_element

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1848 - Minimum Distance to the Target Element.

    Easy

    Given an integer array nums (0-indexed) and two integers target and start, find an index i such that nums[i] == target and abs(i - start) is minimized. Note that abs(x) is the absolute value of x.

    Return abs(i - start).

    It is guaranteed that target exists in nums.

    Example 1:

    Input: nums = 1,2,3,4,5, target = 5, start = 3

    Output: 1

    Explanation: nums4 = 5 is the only value equal to target, so the answer is abs(4 - 3) = 1.

    Example 2:

    Input: nums = 1, target = 1, start = 0

    Output: 0

    Explanation: nums0 = 1 is the only value equal to target, so the answer is abs(0 - 0) = 0.

    Example 3:

    Input: nums = 1,1,1,1,1,1,1,1,1,1, target = 1, start = 0

    Output: 0

    Explanation: Every value of nums is 1, but nums0 minimizes abs(i - start), which is abs(0 - 0) = 0.

    Constraints:

    • 1 <= nums.length <= 1000

    • <code>1 <= numsi<= 10<sup>4</sup></code>

    • 0 &lt;= start &lt; nums.length

    • target is in nums.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer getMinDistance(IntArray nums, Integer target, Integer start)

      • Methods inherited from class java.lang.Object

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