码迷,mamicode.com
首页 > 编程语言 > 详细

Java for LeetCode 223 Rectangle Area

时间:2015-06-15 18:37:58      阅读:143      评论: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.

解题思路:

JAVA实现如下:

    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int minu=0;
        if(E>=C||G<=A||F>=D||H<=B)
        	minu=0;
        else minu=(Math.min(G,C)-Math.max(A,E))*(Math.min(D, H)-Math.max(F, B));
        return (C-A)*(D-B)+(G-E)*(H-F)-minu; 
    }

 

Java for LeetCode 223 Rectangle Area

标签:

原文地址:http://www.cnblogs.com/tonyluis/p/4578785.html

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