Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Solution {
- public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
- int l, m, n, o;
- // calculate l (left edge)
- if (E > A) l = E;
- else l = A;
- // calculate n (right edge)
- if (G > C) n = C;
- else n = G;
- // calculate m (bottom edge)
- if (B > F) m = B;
- else m = F;
- // calculate o (top edge)
- if (D > H) o = H;
- else o = D;
- int area = ((C-A)*(D-B))+((G-E)*(H-F));
- if (A >= G || C <= E || B >= H || D <= F)
- return area;
- return area - ((n - l) * (o - m));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement