• 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.

     

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

    答案:

    没什么好说的,两个矩形相加,如果有重合部分则减去重合部分的面积

     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 sum;
     5         sum=(C-A)*(D-B)+(G-E)*(H-F);
     6         if(E>=C||F>=D||B>=H||A>=G){
     7             return sum;
     8         }
     9         else{
    10             int overlap;
    11             overlap=(min(C,G)-max(E,A))*(min(D,H)-max(B,F));
    12             return (sum-overlap);
    13         }
    14     }
    15 };
  • 相关阅读:
    N^N hdu1060
    二叉树的所有操作
    溢出问题
    POJ1562深搜问题
    已知前序,中序,求后序
    交换a,b
    深度和广度优先搜索
    最长回文子串
    scanf
    WCF Ria Service 理解
  • 原文地址:https://www.cnblogs.com/Reindeer/p/5727375.html
Copyright © 2020-2023  润新知