题目描述：
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.
![[LeetCode]Rectangle Area](https://leetcode.com/static/images/problemset/rectangle_area.png)
Assume that the total area is never beyond ...
作者归档：在线疯狂
[LeetCode]Rectangle Area
[LeetCode]Count Complete Tree Nodes
作者是
发布于
在
LeetCode.
题目描述：
Given a complete binary tree, count the number of nodes.
Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, and all nodes in the last level ...
[LeetCode]Contains Duplicate III
作者是
发布于
在
LeetCode.
题目描述：
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and ...
[LeetCode]Maximal Square
作者是
发布于
在
LeetCode.
题目描述：
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.
For example, given the following matrix:
1 0 1 0 0 1 0 1 1 1 1 1 ...
[LeetCode]Contains Duplicate II
作者是
发布于
在
LeetCode.
题目描述：
Given an array of integers and an integer k, return true if and only if there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j ...