-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy paths0391_prefect_rectangle.rs
More file actions
91 lines (81 loc) · 2.14 KB
/
s0391_prefect_rectangle.rs
File metadata and controls
91 lines (81 loc) · 2.14 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#![allow(unused)]
pub struct Solution {}
use std::cmp::{max, min};
use std::collections::HashSet;
use std::i32::{MAX, MIN};
impl Solution {
// Time O(N) Space O(N)
// reference https://www.youtube.com/watch?v=8JM_dyOu_JY
pub fn is_rectangle_cover(rectangles: Vec<Vec<i32>>) -> bool {
let mut corners = HashSet::new();
let mut area = 0;
for rect in rectangles.iter() {
let p1 = (rect[0], rect[1]);
let p2 = (rect[2], rect[1]);
let p3 = (rect[2], rect[3]);
let p4 = (rect[0], rect[3]);
for p in vec![p1, p2, p3, p4] {
if !corners.insert(p) {
corners.remove(&p);
}
}
area += (p3.0 - p1.0) * (p3.1 - p1.1);
}
if corners.len() != 4 {
return false;
}
let (mut x1, mut y1, mut x2, mut y2) = (MAX, MAX, MIN, MIN);
for p in corners.iter(){
x1 = min(p.0, x1);
y1 = min(p.1, y1);
x2 = max(p.0, x2);
y2 = max(p.1, y2);
}
area == (x2 - x1 ) * (y2 - y1)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_391() {
// code here
assert_eq!(
Solution::is_rectangle_cover(vec![
vec![1, 1, 3, 3],
vec![3, 1, 4, 2],
vec![3, 2, 4, 4],
vec![1, 3, 2, 4],
vec![2, 3, 3, 4]
]),
true
);
assert_eq!(
Solution::is_rectangle_cover(vec![
vec![1, 1, 2, 3],
vec![1, 3, 2, 4],
vec![3, 1, 4, 2],
vec![3, 2, 4, 4]
]),
false
);
assert_eq!(
Solution::is_rectangle_cover(vec![
vec![1, 1, 3, 3],
vec![3, 1, 4, 2],
vec![1, 3, 2, 4],
vec![3, 2, 4, 4]
]),
false
);
assert_eq!(
Solution::is_rectangle_cover(vec![
vec![1, 1, 3, 3],
vec![3, 1, 4, 2],
vec![1, 3, 2, 4],
vec![2, 2, 4, 4]
]),
false
);
}
}