leetCode(33):Rectangle Area 分类: leetCode 2015-07-08 08:06 125人阅读 评论(0) 收藏
2015-07-08 08:06
519 查看
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.
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.
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); if(B>=H || F>=D || E>=C || G<=A) {//如果不相交 return area1+area2; } else { int length,width; width=min(C,G)-max(A,E);//宽 length=min(D,H)-max(B,F);//长 return area1+area2-length*width;//面积之和减去重合部分面积 } } };
相关文章推荐
- Csharp学习第一天
- 2-11章 笔记
- Android自定义标题和按钮效果(附源码)
- Palindrome using recursion
- 从偶然的机会发现一个mysql特性到wooyun waf绕过题
- C 单向链表反转
- Enterprise Solution 界面设计规范
- 又拍云上传文件后,如何访问?
- xcode常用的插件和最新的插件
- 黑马程序员——JAVA笔记——网络
- 【冬瓜哥手绘】关于IO时延你被骗了多久?
- leetcode 233: Number of Digit One
- 使用android OpenGL时出现的java.lang.IllegalArgumentException: Must use a native order direct Buffer错误问题解决
- PL/SQL编码规范
- c#第四次作业
- 征途开始
- 欧拉回路
- 给Asp.Net MVC及WebApi添加路由优先级
- 什么是PV和UV?
- C#第三次作业