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

LeetCode:Rectangle Area

时间:2015-08-11 21:23:38      阅读:109      评论: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.

技术分享

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

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.

 水题

 1 class Solution {
 2 public:
 3     int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
 4         int res = (D - B) * (C - A) + (H - F) * (G - E);
 5         int A1 = max(A, E), B1 = max(B, F), C1 = min(C, G), D1 = min(D, H);
 6         if (D1 <= B1 || C1 <= A1) return res;
 7         return res - (D1 - B1) * (C1 - A1);
 8         
 9     }
10 };

 

LeetCode:Rectangle Area

标签:

原文地址:http://www.cnblogs.com/xiaoying1245970347/p/4722235.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!