Skip to content

3285. Find Indices of Stable Mountains

  • Time: $O(n)$
  • Space: $O(n)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
class Solution {
 public:
  vector<int> stableMountains(vector<int>& height, int threshold) {
    vector<int> ans;

    for (int i = 1; i < height.size(); ++i)
      if (height[i - 1] > threshold)
        ans.push_back(i);

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution {
  public List<Integer> stableMountains(int[] height, int threshold) {
    List<Integer> ans = new ArrayList<>();

    for (int i = 1; i < height.length; ++i)
      if (height[i - 1] > threshold)
        ans.add(i);

    return ans;
  }
}

1
2
3
4
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]