本文主要是介绍LeetCode 223 Rectangle Area，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
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 in.
题目链接：https://leetcode.com/problems/rectangle-area/
题目分析：主要是找重复，总的减去重复的即可
题目链接：https://leetcode.com/problems/rectangle-area/
题目分析：主要是找重复，总的减去重复的即可
public class Solution {public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {int area1 = (C - A) * (D - B);int area2 = (G - E) * (H - F);int buttom = Math.max(B, F);int top = Math.min(D, H);int right = Math.min(C, G);int left = Math.max(A, E);int both;if(buttom > top || left > right) {both = 0;}else {both = (top - buttom) * (right - left);}return area1 + area2 - both;}
}这篇关于LeetCode 223 Rectangle Area的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
