求两个长方形面积
2015-09-03 19:46
232 查看
注意点:虽然左边点都在int范围内,但是两个int相加的结果不一定还在int范围内
public class Solution {
public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int leftWidth=C-A;
int leftHeight=D-B;
int rightWidth=G-E;
int rightHeight=H-F;
double overlapWidth=0,overlapHeight=0;
//如果有重叠的部分
if( (double)Math.max(G,C)-Math.min(E,A)<(double)leftWidth+rightWidth&&(double)Math.max(H, D)-Math.min(F, B)<(double)leftHeight +rightHeight){
overlapWidth=Math.abs(Math.min(G, C)-Math.max(E, A));
overlapHeight=Math.abs(Math.min(D, H)-Math.max(B, F));
}
return leftWidth*leftHeight+rightWidth*rightHeight-(int)overlapWidth*(int)overlapHeight;
}}
public class Solution {
public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int leftWidth=C-A;
int leftHeight=D-B;
int rightWidth=G-E;
int rightHeight=H-F;
double overlapWidth=0,overlapHeight=0;
//如果有重叠的部分
if( (double)Math.max(G,C)-Math.min(E,A)<(double)leftWidth+rightWidth&&(double)Math.max(H, D)-Math.min(F, B)<(double)leftHeight +rightHeight){
overlapWidth=Math.abs(Math.min(G, C)-Math.max(E, A));
overlapHeight=Math.abs(Math.min(D, H)-Math.max(B, F));
}
return leftWidth*leftHeight+rightWidth*rightHeight-(int)overlapWidth*(int)overlapHeight;
}}
相关文章推荐
- NDK开发之ndk-build命令详解
- NDK开发之ndk-build命令详解
- java中IO递归写入
- [转载]Qt之自定义界面(二)添加最小化、关闭按钮、添加背景
- python 爬虫获取网站信息(一)
- fabric run(sudo)运行不起作用
- 深入理解vector list deque——存储结构机理
- 图片加载库Glide
- badblocks指令
- 俩列布局(左边固定,右边自适应),等高布局
- Kruskal算法求解最小生成树
- Codeforces Round #317 A.Lengthening Sticks
- 条款06 若不想使用编译器自动生成的函数 就该明确拒绝
- win7(64位)php5.6-Apache2.4-mysql5.6环境安装
- 欢迎使用CSDN-markdown编辑器
- 这几天学习java里面的子类父类继承接口重载重写。学的好吃力。我得想办法赶紧理解理解!
- Java 编写注释规范模板
- 并查集
- 用CUDA C进行点积运算
- java自定义异常