3285. Find Indices of Stable Mountains

Problem

There are n mountains in a row, and each mountain has a height. You are given an integer array height where height[i] represents the height of mountain i, and an integer threshold.

A mountain is called stable if the mountain just before it (if it exists) has a height strictly greater than threshold. Note that mountain 0 is not stable.

Return an array containing the indices of all stable mountains in any order.

https://leetcode.cn/problems/find-indices-of-stable-mountains/

Example 1:

Input: height = [1,2,3,4,5], threshold = 2
Output: [3,4]
Explanation:

• Mountain 3 is stable because height[2] == 3 is greater than threshold == 2.
• Mountain 4 is stable because height[3] == 4 is greater than threshold == 2.

Example 2:

Input: height = [10,1,10,1,10], threshold = 3
Output: [1,3]

Example 3:

Input: height = [10,1,10,1,10], threshold = 10
Output: []

Constraints:

• 2 <= n == height.length <= 100
• 1 <= height[i] <= 100
• 1 <= threshold <= 100

Test Cases

1
2

class Solution:
    def stableMountains(self, height: List[int], threshold: int) -> List[int]:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

import pytest

from solution import Solution


@pytest.mark.parametrize('height, threshold, expected', [
    ([1,2,3,4,5], 2, [3,4]),
    ([10,1,10,1,10], 3, [1,3]),
    ([10,1,10,1,10], 10, []),
])
@pytest.mark.parametrize('sol', [Solution()])
class Test:
    def test_solution(self, sol, height, threshold, expected):
        result = sol.stableMountains(height, threshold)
        assert sorted(result) == sorted(expected)

Thoughts

直接遍历一遍即可。

Code

1
2
3

class Solution:
    def stableMountains(self, height: list[int], threshold: int) -> list[int]:
        return [i for i in range(1, len(height)) if height[i-1] > threshold]

许可协议

本文除了题目描述（Problem）部分之外，其他内容由 Calf 原创，采用 CC BY-NC-SA 4.0 许可协议，转载请注明出处。

分享文章