leetcode 391. Perfect Rectangle
Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region.
Each rectangle is represented as a bottom-left point and a top-right point....
原创
2019-08-08 09:07:29 ·
138 阅读 ·
0 评论