一文看懂 LeetCode 上 Rectangle Overlap 问题的优化解法，Kotlin 代码演示

见解分享

2023-10-10 08:56:24

LeetCode 题解：Rectangle Overlap

LeetCode 上的 Rectangle Overlap 问题如下：

给定两个矩形 A 和 B，确定它们是否重叠。两个矩形由它们的左下角和右上角坐标表示，格式为 [x1, y1, x2, y2]，其中 (x1, y1) 是左下角的坐标，(x2, y2) 是右上角的坐标。

示例 1：

输入：A = [0, 0, 2, 2], B = [1, 1, 3, 3]
输出：true

示例 2：

输入：A = [0, 0, 1, 1], B = [2, 2, 3, 3]
输出：false

示例 3：

输入：A = [0, 0, 2, 2], B = [2, 2, 2, 2]
输出：false

优化过的 Kotlin 代码解决方案

以下是如何解决 Rectangle Overlap 问题的优化过的 Kotlin 代码：

fun isRectangleOverlap(rect1: IntArray, rect2: IntArray): Boolean {
    // 检查水平线是否有重叠
    val horizontalOverlap = isHorizontalOverlap(rect1, rect2)
    
    // 检查垂直线是否有重叠
    val verticalOverlap = isVerticalOverlap(rect1, rect2)
    
    // 如果水平线和垂直线都有重叠，则矩形重叠
    return horizontalOverlap && verticalOverlap
}

private fun isHorizontalOverlap(rect1: IntArray, rect2: IntArray): Boolean {
    // 检查两个矩形的左边界是否重叠
    val leftOverlap = rect1[0] <= rect2[2] && rect2[0] <= rect1[2]
    
    // 检查两个矩形的右边界是否重叠
    val rightOverlap = rect1[2] >= rect2[0] && rect2[2] >= rect1[0]
    
    // 如果左边界或右边界有重叠，则水平线重叠
    return leftOverlap || rightOverlap
}

private fun isVerticalOverlap(rect1: IntArray, rect2: IntArray): Boolean {
    // 检查两个矩形的上边界是否重叠
    val topOverlap = rect1[3] >= rect2[1] && rect2[3] >= rect1[1]
    
    // 检查两个矩形的下边界是否重叠
    val bottomOverlap = rect1[1] <= rect2[3] && rect2[1] <= rect1[3]
    
    // 如果上边界或下边界有重叠，则垂直线重叠
    return topOverlap || bottomOverlap
}