【leetcode】Contains Duplicate & Rectangle Area（easy）

Contains Duplicate

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

思路：简单题用set

bool containsDuplicate(vector<int>& nums) {
        unordered_set<int> myset;
        for(int i = ; i < nums.size(); ++i)
        {
            if(myset.find(nums[i]) != myset.end())
                return true;
            myset.insert(nums[i]);
        }
        return false;
    }

Rectangle Area

Find the total area covered by two rectilinear rectangles in a 2D plane.

Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.

Assume that the total area is never beyond the maximum possible value of int.

思路：求总面积。直观解法。简单题。

int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int up = min(D, H);
        int down = max(B, F);
        int left = max(A, E);
        int right = min(C, G);
        int In = (up > down && right > left) ? (up - down) * (right - left) : ;
        int area1 = (C - A) * (D - B);
        int area2 = (G - E) * (H - F);
 
        return area1 + area2 - In;
    }