[Python/ C++/ Rust] Very Simple Solution Beats 100%
If the bottom-left point comes after the right-top point wether in the x-axis or the y-axis, then it\'s impossible to overlap and return False, otherwise return
If the `bottom-left` point comes after the `right-top` point wether in the x-axis or the y-axis, then it\'s impossible to overlap and return False, otherwise return True.\n\n# Complexity\n- Time complexity: $$O(1)$$ \n- Space complexity: $$O(1)$$ \n\n# Code\n```python3 []\nclass Solution:\n    def isRectangleOverlap(self, rec1: List[int], rec2: List[int]) -> bool:\n        x1_1, y1_1, x2_1, y2_1 = rec1\n        x1_2, y1_2, x2_2, y2_2 = rec2\n\n        if x1_1 >= x2_2 or y1_1 >= y2_2: return False\n        if x1_2 >= x2_1 or y1_2 >= y2_1: return False\n\n        return True\n```\n```cpp []\nclass Solution {\npublic:\n    bool isRectangleOverlap(vector<int>& rec1, vector<int>& rec2) {\n        int x1_1=rec1[0], y1_1=rec1[1], x2_1=rec1[2], y2_1=rec1[3];\n        int x1_2=rec2[0], y1_2=rec2[1], x2_2=rec2[2], y2_2=rec2[3];\n\n        if( x1_1 >= x2_2 || y1_1 >= y2_2) return false;\n        if( x1_2 >= x2_1 || y1_2 >= y2_1) return false;\n\n        return true;\n    }\n};\n```\n```rust []\nimpl Solution {\n    pub fn is_rectangle_overlap(rec1: Vec<i32>, rec2: Vec<i32>) -> bool {\n        let (x1_1, y1_1, x2_1, y2_1 ) = (rec1[0], rec1[1], rec1[2], rec1[3]);\n        let (x1_2, y1_2, x2_2, y2_2 ) = (rec2[0], rec2[1], rec2[2], rec2[3]);\n\n        if x1_1 >= x2_2 || y1_1 >= y2_2 { return false; }\n        if x1_2 >= x2_1 || y1_2 >= y2_1 { return false; }\n\n        return true;\n    }\n}\n```
['Math', 'Geometry', 'C++', 'Python3', 'Rust']