rust 解法, 执行用时: 0 ms, 内存消耗: 2.2 MB, 提交时间: 2024-12-19 07:50:50

impl Solution {
    pub fn stable_mountains(height: Vec<i32>, threshold: i32) -> Vec<i32> {
        let mut result = Vec::new();
        for i in 1..height.len() {
            if height[i - 1] > threshold {
                result.push(i as i32);
            }
        }
        result
    }
}

javascript 解法, 执行用时: 1 ms, 内存消耗: 52 MB, 提交时间: 2024-12-19 07:50:32

/**
 * @param {number[]} height
 * @param {number} threshold
 * @return {number[]}
 */
var stableMountains = function(height, threshold) {
    const result = [];
    for (let i = 1; i < height.length; i++) {
        if (height[i - 1] > threshold) {
            result.push(i);
        }
    }
    return result;
};

cpp 解法, 执行用时: 1 ms, 内存消耗: 27.6 MB, 提交时间: 2024-12-19 07:50:19

class Solution {
public:
    vector<int> stableMountains(vector<int>& height, int threshold) {
        vector<int> result;
        for (int i = 1; i < height.size(); i++) {
            if (height[i - 1] > threshold) {
                result.push_back(i);
            }
        }
        return result;
    }
};

java 解法, 执行用时: 1 ms, 内存消耗: 43.8 MB, 提交时间: 2024-12-19 07:50:05

class Solution {
    public List<Integer> stableMountains(int[] height, int threshold) {
        List<Integer> result = new ArrayList<>();
        for (int i = 1; i < height.length; i++) {
            if (height[i - 1] > threshold) {
                result.add(i);
            }
        }
        return result;
    }
}

golang 解法, 执行用时: 5 ms, 内存消耗: 2.9 MB, 提交时间: 2024-09-18 16:56:11

func stableMountains(height []int, threshold int) []int {
    var ans []int
    n := len(height)
    for i := 1; i < n; i++ {
        if height[i-1] > threshold {
            ans = append(ans, i)
        }
    }
    return ans
}

python3 解法, 执行用时: 52 ms, 内存消耗: 16.5 MB, 提交时间: 2024-09-18 16:53:13

class Solution:
    def stableMountains(self, height: List[int], threshold: int) -> List[int]:
        return [i for i, h in enumerate(height[:-1], 1) if h > threshold]

python3 解法, 执行用时: 51 ms, 内存消耗: 16.4 MB, 提交时间: 2024-09-18 09:55:06

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