• Skip to primary navigation
  • Skip to content
  • Skip to footer
zhicheng xie's demo blog
  • Quick-Start Guide

    Your Name

    I am an amazing person.

    • Somewhere

    Minimum Distance to the Target Element

    less than 1 minute read

    <-E 1848> Minimum Distance to the Target Element

    class Solution {
    public:
        int getMinDistance(vector<int>& nums, int target, int start) {
            int ans = INT_MAX;
            for(int i = 0; i < nums.size(); i++)
                if(nums[i] == target)     
                    ans = min(ans, abs(start - i));
            return ans;
        }
    };
    

    Tags: Algorithms, C++, Leetcode

    Updated: April 14, 2022

    Share on

    Twitter Facebook LinkedIn
    Previous Next

    You may also enjoy

    Decode Ways

    less than 1 minute read

    <-M 91> Decode Ways

    Word Break

    less than 1 minute read

    <-H 139> Word Break

    Distinct Subsequences

    less than 1 minute read

    <-H 115> Distinct Subsequences

    Edit Distance

    less than 1 minute read

    <-H 72> Edit Distance

    • Follow:
    • Feed
    © 2023 zhicheng xie's blog. Powered by Jekyll & Minimal Mistakes.