[LeetCode] Rectangle Overlap

Given two rectangles, find if the given two rectangles overlap or not.

Example

Example 1:

Input : l1 = [0, 8], r1 = [8, 0], l2 = [6, 6], r2 = [10, 0]
Output : true

Example 2:

Input : l1 = [0, 8], r1 = [8, 0], l2 = [9, 6], r2 = [10, 0]
Output : false

Notice

l1: Top Left coordinate of first rectangle.
r1: Bottom Right coordinate of first rectangle.
l2: Top Left coordinate of second rectangle.
r2: Bottom Right coordinate of second rectangle.

l1 != r2 and l2 != r2

分析:一开始想的是让其中一个rectangle的某个顶点放在另一个rectangle里。这里忽略了一个下图所示case。所以这题的关键点是求重叠部分,然后看所求出的重叠部分是否valid。
 
⚠️注意edge case!!!
public class Solution {
    /**
     * @param l1: top-left coordinate of first rectangle
     * @param r1: bottom-right coordinate of first rectangle
     * @param l2: top-left coordinate of second rectangle
     * @param r2: bottom-right coordinate of second rectangle
     * @return: true if they are overlap or false
     */
    public boolean doOverlap(Point l1, Point r1, Point l2, Point r2) {
        
        int x1 = Math.max(l1.x, l2.x);
        int x2 = Math.min(r1.x, r2.x);
        
        int y1 = Math.max(r1.y, r2.y);
        int y2 = Math.min(l1.y, l2.y);
        
        if (x2 >= x1 && y2 >= y1) {
            return true;
        } else {
            return false;
        }
    }

}

  

转载于:https://www.cnblogs.com/yinger33/p/10928974.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值