LeetCode 836. Rectangle Overlap Solution Explained - Java

Показать описание

Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering

Рекомендации по теме

Комментарии

Nice approach! Can also be done with 'OR' condition-
if( Math.min(x3, x4) >= Math.max(x1, x2) || Math.min(y3, y4) >= Math.max(y1, y2)
|| Math.min(x1, x2) >= Math.max(x3, x4) || Math.min(y1, y2) >= Math.max(y3, y4) ){
return false;
}
else{
return true;
}

AjaySingh-xdnz

This is the updated solution which also checks if the rectangle is a straight line or not. ( Passes updated test cases.)

class Solution {
public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
if(rec1[0] - rec1[2] == 0 || rec1[1] - rec1[3] == 0) return false;
if(rec2[0] - rec2[2] == 0 || rec2[1] - rec2[3] == 0) return false;
return rec1[0] < rec2[2] && rec1[1] < rec2[3] && rec2[0] < rec1[2] && rec2[1] < rec1[3];
}
}

prakharagarwal