{"id":8428,"date":"2021-05-02T22:58:10","date_gmt":"2021-05-03T05:58:10","guid":{"rendered":"https:\/\/zxi.mytechroad.com\/blog\/?p=8428"},"modified":"2021-05-02T23:08:36","modified_gmt":"2021-05-03T06:08:36","slug":"leetcode-1848-minimum-distance-to-the-target-element","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/algorithms\/array\/leetcode-1848-minimum-distance-to-the-target-element\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 1848. Minimum Distance to the Target Element"},"content":{"rendered":"\n

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

Return abs(i - start)<\/code>.<\/p>\n\n\n\n

It is guaranteed<\/strong> that target<\/code> exists in nums<\/code>.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [1,2,3,4,5], target = 5, start = 3\nOutput:<\/strong> 1\nExplanation:<\/strong> nums[4] = 5 is the only value equal to target, so the answer is abs(4 - 3) = 1.\n<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1], target = 1, start = 0\nOutput:<\/strong> 0\nExplanation:<\/strong> nums[0] = 1 is the only value equal to target, so the answer is abs(0 - 0) = 1.\n<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [1,1,1,1,1,1,1,1,1,1], target = 1, start = 0\nOutput:<\/strong> 0\nExplanation:<\/strong> Every value of nums is 1, but nums[0] minimizes abs(i - start), which is abs(0 - 0) = 0.\n<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n
  • 1 <= nums.length <= 1000<\/code><\/li>
  • 1 <= nums[i] <= 104<\/sup><\/code><\/li>
  • 0 <= start < nums.length<\/code><\/li>
  • target<\/code> is in nums<\/code>.<\/li><\/ul>\n\n\n\n
    Solution: Brute Force<\/strong><\/h2>\n\n\n\n
    Time complexity: O(n)
    Space complexity: O(1)<\/p>\n\n\n\n
    \n
    C++<\/h2>\n
    \n\n
    \n\/\/ Author: Huahua\nclass Solution {\npublic:\n  int getMinDistance(vector& nums, int target, int start) {\n    int ans = INT_MAX;\n    for (int i = 0; i < nums.size(); ++i)\n      if (nums[i] == target)\n        ans = min(ans, abs(i - start));    \n    return ans;\n  }\n};\n<\/pre>\n<\/div><\/div>\n","protected":false},"excerpt":{"rendered":"
    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…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[184],"tags":[20,222],"class_list":["post-8428","post","type-post","status-publish","format-standard","hentry","category-array","tag-array","tag-easy","entry","simple"],"_links":{"self":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8428","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/comments?post=8428"}],"version-history":[{"count":2,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8428\/revisions"}],"predecessor-version":[{"id":8430,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/posts\/8428\/revisions\/8430"}],"wp:attachment":[{"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/media?parent=8428"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/categories?post=8428"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/zxi.mytechroad.com\/blog\/wp-json\/wp\/v2\/tags?post=8428"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}