一刷223

Author: diguage

README.adoc

@@ -1587,12 +1587,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Medium
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/rectangle-area/[223. Rectangle Area^]
-//|{source_base_url}/_0223_RectangleArea.java[Java]
-//|{doc_base_url}/0223-rectangle-area.adoc[题解]
-//|Medium
-//|
+|{counter:codes}
+|{leetcode_base_url}/rectangle-area/[223. Rectangle Area^]
+|{source_base_url}/_0223_RectangleArea.java[Java]
+|{doc_base_url}/0223-rectangle-area.adoc[题解]
+|Medium
+|
 
 |{counter:codes}
 |{leetcode_base_url}/basic-calculator/[224. Basic Calculator^]

docs/0000-04-merge-intervals.adoc

@@ -18,11 +18,13 @@ image::images/0056-01.png[{image_attr}]
 . xref:0056-merge-intervals.adoc[56. Merge Intervals]
 . xref:0057-insert-interval.adoc[57. Insert Interval]
 . xref:0986-interval-list-intersections.adoc[986. Interval List Intersections]
+. xref:0223-rectangle-area.adoc[223. 矩形面积] -- 这道题不是区间合并类型的题目。但是，在处理相交面积时的手段和区间合并的手段是类似的！
 . xref:0252-meeting-rooms.adoc[252. Meeting Rooms]
 . xref:0253-meeting-rooms-ii.adoc[253. Meeting Rooms II]
 . xref:0452-minimum-number-of-arrows-to-burst-balloons.adoc[452. Minimum Number of Arrows to Burst Balloons]
 . xref:0759-employee-free-time.adoc[759. Employee Free Time]
 . xref:1094-car-pooling.adoc[1094. Car Pooling]
 
 
+
 Conflicting Appointments (medium)

docs/0223-rectangle-area.adoc

@@ -1,31 +1,70 @@
 [#0223-rectangle-area]
-= 223. Rectangle Area
+= 223. 矩形面积
 
-{leetcode}/problems/rectangle-area/[LeetCode - Rectangle Area^]
+https://leetcode.cn/problems/rectangle-area/[LeetCode - 223. 矩形面积 ^]
 
-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.
+每个矩形由其 *左下* 顶点和 *右上* 顶点坐标表示：
 
-image::https://assets.leetcode.com/uploads/2018/10/22/rectangle_area.png[{image_attr}]
+* 第一个矩形由其左下顶点 `+(ax1, ay1)+` 和右上顶点 `+(ax2, ay2)+` 定义。
+* 第二个矩形由其左下顶点 `+(bx1, by1)+` 和右上顶点 `+(bx2, by2)+` 定义。
 
-*Example:*
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2
-*Output:* 45
-----
+*示例 1：*
+
+image::images/0223-01.png[{image_attr}]
+
+....
+输入：ax1 = -3, ay1 = 0, ax2 = 3, ay2 = 4, bx1 = 0, by1 = -1, bx2 = 9, by2 = 2
+输出：45
+....
+
+*示例 2：*
+
+....
+输入：ax1 = -2, ay1 = -2, ax2 = 2, ay2 = 2, bx1 = -2, by1 = -2, bx2 = 2, by2 = 2
+输出：16
+....
+
 
-*Note:*
+*提示：*
 
-Assume that the total area is never beyond the maximum possible value of *int*.
+* `-10^4^ \<= ax1, ay1, ax2, ay2, bx1, by1, bx2, by2 \<= 10^4^`
 
 
 
+== 思路分析
+
+原本还想按分离，包含和相交三种情况来处理，提交后发现相交的情况有很多种，不好处理！
+
+看题解，可以直接用容斥原理，与 xref:0000-04-merge-intervals.adoc[Merge Intervals 区间合并] 类型解题时，使用的处理手段类似，求出相交线段，即可求出重叠面积。
+
+
 [[src-0223]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0223_RectangleArea.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0223_RectangleArea_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/rectangle-area/solutions/1024841/gong-shui-san-xie-yun-yong-rong-chi-yuan-hzit/[223. 矩形面积 - 【宫水三叶】运用容斥原理求解^]
+. https://leetcode.cn/problems/rectangle-area/solutions/1024639/ju-xing-mian-ji-by-leetcode-solution-xzbl/[223. 矩形面积 - 官方题解^]

docs/images/0223-01.png

@@ -531,7 +531,7 @@ include::0221-maximal-square.adoc[leveloffset=+1]
 
 include::0222-count-complete-tree-nodes.adoc[leveloffset=+1]
 
-// include::0223-rectangle-area.adoc[leveloffset=+1]
+include::0223-rectangle-area.adoc[leveloffset=+1]
 
 include::0224-basic-calculator.adoc[leveloffset=+1]
 

docs/index.adoc

@@ -1108,6 +1108,11 @@ endif::[]
 |{doc_base_url}/0594-longest-harmonious-subsequence.adoc[题解]
 |✅ 最简单的解法是排序。时间复杂度更优的解答是哈希计数。
 
+|{counter:codes2503}
+|{leetcode_base_url}/rectangle-area/[223. 矩形面积^]
+|{doc_base_url}/0223-rectangle-area.adoc[题解]
+|⭕️ 原本还想按分离，包含和相交三种情况来处理，相交情况太多，放弃！容斥原理的处理手段和 {doc_base_url}/0000-04-merge-intervals.adoc[Merge Intervals 区间合并] 题目的方式类似！
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

logbook/202503.adoc

@@ -8,6 +8,10 @@
  */
 public class _0222_CountCompleteTreeNodes {
   // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2020-01-28 12:21
+   */
   public int countNodes(TreeNode root) {
     if (root == null) {
       return 0;

src/main/java/com/diguage/algo/leetcode/_0222_CountCompleteTreeNodes.java

@@ -0,0 +1,16 @@
+package com.diguage.algo.leetcode;
+
+public class _0223_RectangleArea {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-07-01 17:28:11
+   */
+  public int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
+    int overx = Math.max(0, Math.min(ax2, bx2) - Math.max(ax1, bx1));
+    int overy = Math.max(0, Math.min(ay2, by2) - Math.max(ay1, by1));
+    return (ax2 - ax1) * (ay2 - ay1) + (bx2 - bx1) * (by2 - by1) - overx * overy;
+  }
+  // end::answer[]
+}