[LeetCode] 1762. Buildings With an Ocean View

There are n buildings in a line. You are given an integer array heights of size n that represents the heights of the buildings in the line.

The ocean is to the right of the buildings. A building has an ocean view if the building can see the ocean without obstructions. Formally, a building has an ocean view if all the buildings to its right have a smaller height.

Return a list of indices (0-indexed) of buildings that have an ocean view, sorted in increasing order.

Example 1:

Input: heights = [4,2,3,1]
Output: [0,2,3]
Explanation: Building 1 (0-indexed) does not have an ocean view because building 2 is taller.

Example 2:

Input: heights = [4,3,2,1]
Output: [0,1,2,3]
Explanation: All the buildings have an ocean view.

Example 3:

Input: heights = [1,3,2,4]
Output: [3]
Explanation: Only building 3 has an ocean view.

Example 4:

Input: heights = [2,2,2,2]
Output: [3]
Explanation: Buildings cannot see the ocean if there are buildings of the same height to its right.

Constraints:

• 1 <= heights.length <= 105
• 1 <= heights[i] <= 109

我这里提供两种思路，一是贪心，二是单调栈。

因为海是在数组的右边，数组最后一个元素是没有被挡住的，所以它有oceanview。照着这个思路，我们从数组的最右边开始往左扫描，如果遇到更高的楼，那么这个更高的楼就是有oceanview的；反之则是没有。

时间O(n)

空间O(n)

Java实现

class Solution {
    public int[] findBuildings(int[] heights) {
        int max = 0;
        List<Integer> list = new ArrayList<>();
        for (int i = heights.length - 1; i >= 0; i--) {
            if (heights[i] > max) {
                list.add(i);
                max = heights[i];
            }
        }

        int[] res = new int[list.size()];
        Collections.reverse(list);
        for (int i = 0; i < res.length; i++) {
            res[i] = list.get(i);
        }
        return res;
    }
}

单调栈其实也是类似的思路，但是单调栈可以让我们从左往右遍历input数组。我们这里做的是一个单调递增的栈。

时间O(n)

空间O(n)

Java实现

class Solution {
    public int[] findBuildings(int[] heights) {
        Deque<Integer> stack = new ArrayDeque<>();
        for (int i = 0; i < heights.length; i++) {
            while (!stack.isEmpty() && heights[stack.peekLast()] <= heights[i]) {
                stack.pollLast();
            }
            stack.addLast(i);
        }
        int n = stack.size();
        int[] res = new int[n];
        while (!stack.isEmpty()) {
            res[--n] = stack.pollLast();
        }
        return res;
    }
}

LeetCode 题目总结