Leetcode Rectangle Area
来源：互联网 发布：批判性思维工具 知乎 编辑：程序博客网 时间：2024/05/17 00:16
Find the total area covered by two rectilinear rectangles in a 2D plane.
Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.
Assume that the total area is never beyond the maximum possible value of int.
Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.
Difficulty: Easy
public class Solution { public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int x1 = Math.max(A, E); int y1 = Math.max(B, F); int x2 = Math.min(C, G); int y2 = Math.min(D, H); int overlap = 0; if(x2 > x1 && y2 > y1){ overlap = (x2 - x1) * (y2 - y1); } return (D - B) * (C - A) + (H - F) * (G - E) - overlap; }} 0 0
- leetcode Rectangle Area
- [LeetCode] Rectangle Area
- leetcode--Rectangle Area
- [LeetCode]Rectangle Area
- [leetcode] Rectangle Area
- Rectangle Area - LeetCode 223
- leetcode-Rectangle Area[math]
- leetCode 之 Rectangle Area
- leetcode 223: Rectangle Area
- [leetcode]Rectangle Area
- leetcode[223]:Rectangle Area
- LeetCode Rectangle Area
- [leetcode][math] Rectangle Area
- #leetcode#Rectangle Area
- [LeetCode] Rectangle Area
- LeetCode: Rectangle Area
- Leetcode 223 Rectangle Area
- [Leetcode]-Rectangle Area
- javac不是内部或外部命令
- Markdown用例
- Mysql中where 1=1 和count(0) 使用小技巧
- Leetcode Triangle
- Codeforces Round #363 (Div. 2)[A]Launch of Collider
- Leetcode Rectangle Area
- 在Unity中使用ProtoBuffer进行数值表转换以及生成网络通信用的协议
- Leetcode Gas Station
- CodeForces 346A Alice and Bob
- Codeforces Round #363 (Div. 2)[B]One Bomb
- POJ 3320 Jessica's Reading Problem
- 字节对齐详解
- 应用内跳转百度，高德地图
- 【题】【矩阵】NKOJ 1901 喜欢奇数的面包师
