-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path836_rectangle_overlap.py
24 lines (20 loc) · 1.09 KB
/
836_rectangle_overlap.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution:
def isRectangleOverlap(self, rec1: List[int], rec2: List[int]) -> bool:
if (rec2[0] >= rec1[2]) or (rec2[2] <= rec1[0]) or (rec2[1] >= rec1[3]) or (rec2[3] <= rec1[1]):
return False
return True
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''