939. Minimum Area Rectangle

Description

Given a set of points in the xy-plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and y axes.

If there isn’t any rectangle, return 0.

Example 1:

Input: [[1,1],[1,3],[3,1],[3,3],[2,2]]
Output: 4
Example 2:

Input: [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
Output: 2

Note:

1 <= points.length <= 500
0 <= points[i][0] <= 40000
0 <= points[i][1] <= 40000
All points are distinct.

Problem URL

---

Solution

给一些平面上的点集，问这些点能够围成的长方形的最小面积是多少。

Using a hash map to contain a map from each x-index to its y-index set. Then use a double for loop to compare each points, if they are on same line, continue; If they could find corresponding points on each other line, we could form a rectangle, calculate the area.

Code

class Solution {
    public int minAreaRect(int[][] points) {
        Map<Integer, Set<Integer>> map = new HashMap<>();
        for (int[] point : points){
            if (!map.containsKey(point[0])){
                map.put(point[0], new HashSet<>());
            }
            map.get(point[0]).add(point[1]);
        }
        int res = Integer.MAX_VALUE;
        for (int[] p1 : points){
            for (int[] p2 : points){
                if (p1[0] == p2[0] || p1[1] == p2[1]){
                    continue;
                }
                if (map.get(p1[0]).contains(p2[1]) && map.get(p2[0]).contains(p1[1])){
                    res = Math.min(res, Math.abs(p1[0] - p2[0]) * Math.abs(p1[1] - p2[1]));
                }
            }
        }
        return res == Integer.MAX_VALUE ? 0 : res;
    }
}

Time Complexity: O(n^2)
Space Complexity: O(n)

---

Review