zoukankan      html  css  js  c++  java
  • [leetcode] Rectangle Area

    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.

     
    Credits:
    Special thanks to @mithmatt for adding this problem, creating the above image and all test cases
     
     求矩形覆盖面积。因为只有两个矩形,所以直接算结果 = 两个矩形的面积 - 相交的面积。
     
    class Solution
    {
    public:
      int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)
      {
        int x1 = A > E ? A : E;
        int y1 = B > F ? B : F;
        int x2 = C > G ? G : C;
        int y2 = D > H ? H : D;
    
        int x = x2 - x1, y = y2 - y1;
        int s = 0;
        if(x>0 && y>0)
          s = x * y;
    
        return (C-A)*(D-B)+(G-E)*(H-F) - s;
      }
    };
  • 相关阅读:
    大道至简阅读笔记01
    3.2-3.8 第三周总结
    全国疫情统计可视化地图 01
    数据爬取
    全国疫情统计可视化地图
    第3周总结
    第2周总结
    开课博客
    数组
    从小工到专家 读后感2
  • 原文地址:https://www.cnblogs.com/lxd2502/p/4563911.html
Copyright © 2011-2022 走看看