2905. 找出满足差值条件的下标 II

Python ml

于 2024-02-19 12:10:39 发布

阅读量150

点赞数 1

分类专栏： LeetCode 文章标签：数据结构

本文链接：https://blog.csdn.net/m0_48711099/article/details/136167521

版权

LeetCode 专栏收录该内容

180 篇文章 0 订阅

订阅专栏

class Solution:
    def findIndices(self, nums: List[int], indexDifference: int, valueDifference: int) -> List[int]:
        min_idx = max_idx = 0
        for i in range(indexDifference, len(nums)):
            j = i - indexDifference
            if nums[j] < nums[min_idx]:
                min_idx = j
            if nums[j] > nums[max_idx]:
                max_idx = j
            if nums[max_idx] - nums[i] >= valueDifference:
                return [max_idx, i]
            if nums[i] - nums[min_idx] >= valueDifference:
                return [min_idx, i]
        return [-1, -1]