algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 09:23:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update solution 0391

Browse Source
This commit is contained in:
halfrost
2021-11-21 21:21:21 +08:00
committed by halfrost
parent fd41bd923c
commit 0495d2b0ff
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
leetcode/0391.Perfect-Rectangle/README.md
View File

@ -1,4 +1,4 @@
# [391. Perfect Rectangle](https://leetcode-cn.com/problems/perfect-rectangle/)
# [391. Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/)
## 题目
@ -52,11 +52,12 @@ Return true if all the rectangles together form an exact cover of a rectangular
## 解题思路
- 矩形区域的面积等于所有矩形的面积之和并且满足矩形区域四角的顶点只能出现一次，且其余顶点的出现次数只能是两次或四次则返回true,否则返回false
- 矩形区域的面积等于所有矩形的面积之和并且满足矩形区域四角的顶点只能出现一次，且其余顶点的出现次数只能是两次或四次则返回 true,否则返回 false
## 代码
```go
package leetcode
type point struct {