int y1 = points[i][1]; int x2 = points[j][0]; int y2 = points[j][1]; if (x1 == x2 || y1 == y2) { continue; } String corner1 = x1 + "," + y2; String corner2 = x2 + "," + y1; if (pointSet.contains(corner1) && pointSet.contains(corner2)) { int area = Math.abs(x2 - x1) * Math.abs(y2 - y1); maxArea = Math.max(maxArea, area); } } } return maxArea; } } 17:T418,class Solution { public maxRectangleArea(points: number[][]): number { const pointSet = new Set(); for (const point of points) { pointSet.add(point[0] + "," + point[1]); } let maxArea = 0; // Check all pairs of points as potential diagonal corners for (let i = 0; i < points.length; i++) { for (let j = i + 1; j < points.length; j++) { const x1 = points[i][0]; const y1 = points[i][1]; const x2 = points[j][0]; const y2 = points[j][1]; if (x1 === x2 || y1 === y2) { continue; } const corner1 = x1 + "," + y2; const corner2 = x2 + "," + y1; if (pointSet.has(corner1) && pointSet.has(corner2)) { const area = Math.abs(x2 - x1) * Math.abs(y2 - y1); maxArea = Math.max(maxArea, area); } } } return maxArea; } }18:T4dc,#include #include #include #include #include #include using namespace std; class Solution { public: int maxRectangleArea(vector> points) { unordered_set pointSet; for (const auto& point : points) { pointSet.insert(to_string(point[0]) + "," + to_string(point[1])); }

Ask AI Assistant