"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 ele ment is distinct.

Idea: Simple problem with Set

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

Rectangle Area

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

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

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

Idea: to seek the total area. Intuitive solution. Simple question.

intComputearea (intAintBintCintDintEintFintGintH) {intup =min (D, H); intDown =Max (B, F); intleft =Max (A, E); intright =min (C, G); intin = (Up > down && right > left)? (up-down) * (right-left):0; intAREA1 = (c-a) * (D-B); intAREA2 = (g-e) * (H-F); returnAREA1 + AREA2-In ; }

"Leetcode" Contains Duplicate & Rectangle Area (easy)