(LeetCode 223) Rectangle Area
来源：互联网 发布：天涯明月刀低配优化 编辑：程序博客网 时间：2024/05/18 01:23
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.
题意简单，给你两个矩形，求它的总面积
solution:
单纯的条件判断，就不细说了。
class Solution {public: int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int area = (C-A)*(D-B)+(G-E)*(H-F); if(E>=C||G<=A||F>=D||H<=B)return area; int blX = (E>A)?E:A; int blY = (B>F)?B:F; int trX = (C<G)?C:G; int trY = (D<H)?D:H; return area-(trX-blX)*(trY-blY); }}; 1 0
- Rectangle Area - LeetCode 223
- leetcode 223: Rectangle Area
- leetcode[223]:Rectangle Area
- Leetcode 223 Rectangle Area
- leetcode 223:Rectangle Area
- leetcode-223 Rectangle Area
- Leetcode #223 Rectangle Area
- leetCode #223 Rectangle Area
- leetcode 223: Rectangle Area
- [Leetcode]#223 Rectangle Area
- [LeetCode 223] Rectangle Area
- [leetcode 223] Rectangle Area
- LeetCode 223 Rectangle Area
- LeetCode 223:Rectangle Area
- 【LEETCODE】223-Rectangle Area
- leetcode 223: Rectangle Area
- leetcode 223: Rectangle Area
- 【leetcode】【223】Rectangle Area
- 简单的mvc框架（六）
- TCP的拥塞控制
- 二叉树的最大深度
- elastic search 配置文件
- POJ-3292 Semi-prime H-numbers
- (LeetCode 223) Rectangle Area
- NIO和BIO
- c++序列化与反序列化
- 计算机网络安全实验-缓存区溢出攻击
- 多线程
- Context---上下文
- java之继承
- java基础语法
- ACM刷题之HDU————今年暑假不AC
