-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathrectangle_area.dart
213 lines (186 loc) · 7.53 KB
/
rectangle_area.dart
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
/*
-* 223. Rectangle Area *-
Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area covered by the two rectangles.
The first rectangle is defined by its bottom-left corner (ax1, ay1) and its top-right corner (ax2, ay2).
The second rectangle is defined by its bottom-left corner (bx1, by1) and its top-right corner (bx2, by2).
Example 1:
Rectangle Area
Input: ax1 = -3, ay1 = 0, ax2 = 3, ay2 = 4, bx1 = 0, by1 = -1, bx2 = 9, by2 = 2
Output: 45
Example 2:
Input: ax1 = -2, ay1 = -2, ax2 = 2, ay2 = 2, bx1 = -2, by1 = -2, bx2 = 2, by2 = 2
Output: 16
Constraints:
-104 <= ax1 <= ax2 <= 104
-104 <= ay1 <= ay2 <= 104
-104 <= bx1 <= bx2 <= 104
-104 <= by1 <= by2 <= 104
*/
import 'dart:math';
class A {
int computeArea(
int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
// Calculating Area Of A and B
int areaA = (ax2 - ax1) * (ay2 - ay1);
int areaB = (bx2 - bx1) * (by2 - by1);
// Calculating The Left Boundary
int leftBoundary = max(ax1, bx1);
// Calculating The Right Boundary
int rightBoundary = min(bx2, ax2);
// Calculating The Up Boundary
int upperBoundary = min(by2, ay2);
// Calculating The Down Boundary
int lowerBoundary = max(ay1, by1);
// Total Area
int totalArea = areaA + areaB;
// If Both Rectangle Overlaps
if (rightBoundary > leftBoundary && upperBoundary > lowerBoundary)
totalArea -=
((rightBoundary - leftBoundary) * (upperBoundary - lowerBoundary));
return totalArea;
}
}
class B {
int computeArea(
int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
int a = (ax2 - ax1) * (ay2 - ay1);
int b = (bx2 - bx1) * (by2 - by1);
if (ax1 >= bx2 || ax2 <= bx1 || ay2 <= by1 || ay1 >= by2) return a + b;
return (a +
b -
(min(bx2, ax2) - max(ax1, bx1)) * (min(ay2, by2) - max(ay1, by1)))
.toInt();
}
}
class C {
int computeArea(
int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
if (ax1 <= bx1 && ay1 <= by1 && ax2 >= bx2 && ay2 >= by2)
return (ax2 - ax1) * (ay2 - ay1);
if (ax1 >= bx1 && ay1 >= by1 && ax2 <= bx2 && ay2 <= by2)
return (bx2 - bx1) * (by2 - by1);
if (ax1 >= bx1 && ax2 <= bx2 && ay2 >= by2 && ay1 <= by1)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - ax1) * (by2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (ax1 <= bx1 && ax2 >= bx2 && ay2 <= by2 && ay1 >= by1)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - bx1) * (ay2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && ax1 <= bx1 && ay2 >= by2 && ay1 <= by1)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (by2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (by2 >= ay1 && by2 <= ay2 && bx1 >= ax1 && bx2 <= ax2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - bx1) * (by2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && bx2 <= ax2 && by1 >= ay1 && by2 <= ay2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (by2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (by1 >= ay1 && by1 <= ay2 && bx1 >= ax1 && bx2 <= ax2)
return (ax2 - ax1) * (ay2 - ay1) -
(ay2 - by1) * (bx2 - bx1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && bx1 <= ax1 && by2 >= ay2 && by1 <= ay1)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (ay2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (ay2 >= by1 && ay2 <= by2 && ax1 >= bx1 && ax2 <= bx2)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - ax1) * (ay2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && ax2 <= bx2 && ay1 >= by1 && ay2 <= by2)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (ay2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (ay1 >= by1 && ay1 <= by2 && ax1 >= bx1 && ax2 <= bx2)
return (ax2 - ax1) * (ay2 - ay1) -
(by2 - ay1) * (ax2 - ax1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && bx2 >= ax2 && ay1 >= by1 && by2 >= ay1)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (by2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && ax1 >= bx1 && by1 <= ay1 && ay1 <= by2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (by2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && ax1 >= bx1 && by2 >= ay2 && by1 <= ay2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (ay2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && ax2 <= bx2 && by1 <= ay2 && by2 >= ay2)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (ay2 - by1) +
(bx2 - bx1) * (by2 - by1);
return (ax2 - ax1) * (ay2 - ay1) + (bx2 - bx1) * (by2 - by1);
}
}
class D {
int computeArea(
int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
if (ax1 <= bx1 && ay1 <= by1 && ax2 >= bx2 && ay2 >= by2)
return (ax2 - ax1) * (ay2 - ay1);
if (ax1 >= bx1 && ay1 >= by1 && ax2 <= bx2 && ay2 <= by2)
return (bx2 - bx1) * (by2 - by1);
if (ax1 >= bx1 && ax2 <= bx2 && ay2 >= by2 && ay1 <= by1)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - ax1) * (by2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (ax1 <= bx1 && ax2 >= bx2 && ay2 <= by2 && ay1 >= by1)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - bx1) * (ay2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && ax1 <= bx1 && ay2 >= by2 && ay1 <= by1)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (by2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (by2 >= ay1 && by2 <= ay2 && bx1 >= ax1 && bx2 <= ax2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - bx1) * (by2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && bx2 <= ax2 && by1 >= ay1 && by2 <= ay2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (by2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (by1 >= ay1 && by1 <= ay2 && bx1 >= ax1 && bx2 <= ax2)
return (ax2 - ax1) * (ay2 - ay1) -
(ay2 - by1) * (bx2 - bx1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && bx1 <= ax1 && by2 >= ay2 && by1 <= ay1)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (ay2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (ay2 >= by1 && ay2 <= by2 && ax1 >= bx1 && ax2 <= bx2)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - ax1) * (ay2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && ax2 <= bx2 && ay1 >= by1 && ay2 <= by2)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (ay2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (ay1 >= by1 && ay1 <= by2 && ax1 >= bx1 && ax2 <= bx2)
return (ax2 - ax1) * (ay2 - ay1) -
(by2 - ay1) * (ax2 - ax1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && bx2 >= ax2 && ay1 >= by1 && by2 >= ay1)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (by2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && ax1 >= bx1 && by1 <= ay1 && ay1 <= by2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (by2 - ay1) +
(bx2 - bx1) * (by2 - by1);
if (bx2 >= ax1 && ax1 >= bx1 && by2 >= ay2 && by1 <= ay2)
return (ax2 - ax1) * (ay2 - ay1) -
(bx2 - ax1) * (ay2 - by1) +
(bx2 - bx1) * (by2 - by1);
if (ax2 >= bx1 && ax2 <= bx2 && by1 <= ay2 && by2 >= ay2)
return (ax2 - ax1) * (ay2 - ay1) -
(ax2 - bx1) * (ay2 - by1) +
(bx2 - bx1) * (by2 - by1);
return (ax2 - ax1) * (ay2 - ay1) + (bx2 - bx1) * (by2 - by1);
}
}