首页 > 其他 > 详细

Leetcode: Rectangle Area

时间:2015-12-18 06:43:23      阅读:170      评论:0      收藏:0      [点我收藏+]
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.

Rectangle Area
Assume that the total area is never beyond the maximum possible value of int.

技术分享

 1 public class Solution {
 2     public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
 3         int area3 = 0;
 4         int area1 = (C-A) * (D-B);
 5         int area2 = (G-E) * (H-F);
 6         if (C<=E || G<=A || H<=B || D<=F) area3 = 0;
 7         else area3 = (Math.min(C,G)-Math.max(A,E)) * (Math.min(D,H)-Math.max(B,F));
 8         return area1 + area2 - area3;
 9     }
10 }

 

Leetcode: Rectangle Area

原文:http://www.cnblogs.com/EdwardLiu/p/5055848.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!