网站首页 站内搜索

搜索结果

查询Tags标签: 1848,共有 1条记录
  • leetcode 1848. Minimum Distance to the Target Element (python)

    描述 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 targ…

    2021/6/5 14:22:30 人评论 次浏览
扫一扫关注最新编程教程