zoukankan      html  css  js  c++  java
  • LeetCode之“数学”: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.

      为了更好说明问题,在这里特地画了几个图:

      

      我们要求的面积 = 两个矩形面积和 - 两者重叠部分。

      

      可能出现的四种情况。

      根据以上四种可能出现的情况,我们编写程序如下(参考自一博文):

     1 class Solution {
     2 public:
     3     int overlapArea(int A, int B, int C, int D, int E, int F, int G, int H)
     4     {
     5         int v1 = max(A, E);
     6         int v2 = min(C, G);
     7         int v = v2 - v1;
     8         
     9         int h1 = max(B, F);
    10         int h2 = min(D, H);
    11         int h= h2 - h1;
    12         
    13         if(v <= 0 || h <= 0)
    14             return 0;
    15         else
    16             return v * h;
    17     }
    18     
    19     int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
    20         int area1 = (C - A) * (D - B);
    21         int area2 = (G - E) * (H - F);
    22         int overlapRegion = overlapArea(A, B, C, D, E, F, G, H);
    23         return area1 + area2 - overlapRegion;
    24     }
    25 };
  • 相关阅读:
    JVM三部曲之运行时数据区 (第一部)
    c++鼠标点点,获取坐标值,放入到txt文件中
    自己实现的SVM源码
    SVM资料
    caffe源码解析
    caffe调试小结2
    caffe中卷积层和pooling层计算下一层的特征map的大小
    gpu对任意长度的矢量求和
    caffe代码调试小结
    caffe添加自己的层
  • 原文地址:https://www.cnblogs.com/xiehongfeng100/p/4573350.html
Copyright © 2011-2022 走看看