Rectangle Area
来源:互联网 发布:键盘美化软件下载 编辑:程序博客网 时间:2024/05/01 09:58
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.
求矩形的面积,可以分为三种情况:两个矩形左右分离;上下分离;相交;
相交时求左边下边的最大值,右边上边的最小值。
public int computeArea(int A,int B,int C,int D,int E,int F,int G,int H) {if(A>G||E>C)return (C-A)*(D-B)+(G-E)*(H-F);if(B>H||F>D)return (C-A)*(D-B)+(G-E)*(H-F);int left=Math.max(A, E);int right=Math.min(C, G);int top=Math.min(D, H);int bottom=Math.max(B, F);return (C-A)*(D-B)+(G-E)*(H-F)-(right-left)*(top-bottom);}
0 0
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- Rectangle Area
- android 源码各版本下载 原生纯净版
- 二叉树中的最大路径和
- iOS UI初级-UIVew与UIWindow
- git 常用命令
- Linux命令中的rmdir
- Rectangle Area
- iOS UI初级-常用UI控件
- iOS开发中的小技巧
- linux下mysql默认安装目录和常用命令
- git 克隆远程仓库并创建分支、提交分支、获取分支
- HDU 5405 Sometimes Naive 2015多校联合训练赛#9 LCT 树链剖分
- 每天都好困的说
- 异步,线程,并行概念
- 再谈应用环境下的TIME_WAIT和CLOSE_WAIT