LeetCode in Kotlin

699. Falling Squares

Hard

There are several squares being dropped onto the X-axis of a 2D plane.

You are given a 2D integer array positions where positions[i] = [lefti, sideLengthi] represents the ith square with a side length of sideLengthi that is dropped with its left edge aligned with X-coordinate lefti.

Each square is dropped one at a time from a height above any landed squares. It then falls downward (negative Y direction) until it either lands on the top side of another square or on the X-axis. A square brushing the left/right side of another square does not count as landing on it. Once it lands, it freezes in place and cannot be moved.

After each square is dropped, you must record the height of the current tallest stack of squares.

Return an integer array ans where ans[i] represents the height described above after dropping the ith square.

Example 1:

Input: positions = [[1,2],[2,3],[6,1]]

Output: [2,5,5]

Explanation:

After the first drop, the tallest stack is square 1 with a height of 2.

After the second drop, the tallest stack is squares 1 and 2 with a height of 5.

After the third drop, the tallest stack is still squares 1 and 2 with a height of 5.

Thus, we return an answer of [2, 5, 5].

Example 2:

Input: positions = [[100,100],[200,100]]

Output: [100,100]

Explanation:

After the first drop, the tallest stack is square 1 with a height of 100.

After the second drop, the tallest stack is either square 1 or square 2, both with heights of 100.

Thus, we return an answer of [100, 100].

Note that square 2 only brushes the right side of square 1, which does not count as landing on it.

Constraints:

• 1 <= positions.length <= 1000
• 1 <= lefti <= 108
• 1 <= sideLengthi <= 106

Solution

import java.util.Collections
import java.util.TreeSet

class Solution {
    fun fallingSquares(positions: Array<IntArray>): List<Int> {
        // Coordinate compression using TreeSet
        val unique: MutableSet<Int> = TreeSet()
        for (square in positions) {
            unique.add(square[0])
            unique.add(square[0] + square[1] - 1)
        }
        // converted the TreeSet to a List
        val sorted: List<Int> = ArrayList(unique)
        // Storing the max heights for compressed coordinates
        val heights = IntArray(sorted.size)
        // Our answer list
        val list: MutableList<Int> = ArrayList(positions.size)
        // Global Max
        var max = 0
        for (square in positions) {
            // coordinate compression lookup
            val x1 = Collections.binarySearch(sorted, square[0])
            val x2 = Collections.binarySearch(sorted, square[0] + square[1] - 1)
            // get the current max for the interval between x1 and x2
            var current = 0
            for (i in x1..x2) {
                current = current.coerceAtLeast(heights[i])
            }
            // add the new square on the top
            current += square[1]
            // update the interval with the new value
            for (i in x1..x2) {
                heights[i] = current
            }
            // recalculate the global max
            max = max.coerceAtLeast(current)
            list.add(max)
        }
        return list
    }
}

This site is open source. Improve this page.