leetcode 223. Rectangle Area

class Solution {public:    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {        int x1 = max(A,E),x2=min(C,G);        int y2 = min(D,H),y1=max(B,F);        int t1 = 0, t2 = 0;        if(x1 < x2) t1 = x2-x1;        if(y1 < y2) t2 = y2-y1;        return (C-A)*(D-B)+(G-E)*(H-F)-t1*t2;    }};