码迷,mamicode.com
首页 > 其他好文 > 详细

Leetcode: Rectangle Area

时间:2015-12-18 06:44:23      阅读:134      评论: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
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!