[leedcode 223] Rectangle Area

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.

public class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        //分四种场景分开讨论,寻找规律:如果发现重叠,需要减去重叠部分
        //注意技巧,Math函数
        if(G<=A||E>=C||B>=H||F>=D)
          return (C-A)*(D-B)+(G-E)*(H-F);
        else{
            return (C-A)*(D-B)+(G-E)*(H-F)-(Math.min(C,G)-Math.max(A,E))*(Math.min(H,D)-Math.max(B,F));
        }
    }
}

 

posted @ 2015-08-07 23:22  ~每天进步一点点~  阅读(107)  评论(0编辑  收藏  举报