大纲
题目
地址
https://leetcode.com/problems/find-indices-of-stable-mountains/description/
内容
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.
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
解题
这题就是要记录一个数组中，比某个数大的下一个数的下标。这个问题有个边界，即只要遍历到最后一个元素的之前的元素即可。因为判断条件之和前一个元素有关系。
#include <vector>
using namespace std;
class Solution {
public:
vector<int> stableMountains(vector<int>& height, int threshold) {
vector<int> result;
for (int i = 0; i < height.size() - 1; i++) {
if (height[i] > threshold) {
result.push_back(i+1);
}
}
return result;
}
};
代码地址
https://github.com/f304646673/leetcode/tree/main/3285-Find-Indices-of-Stable-Mountains/cplusplus
标签：Mountains,greater,10,stable,height,Stable,threshold,mountain,Find From： https://blog.csdn.net/breaksoftware/article/details/142355485