feat: Solve LeetCode Daily Challenge #3047

Author: chaimode

include/leetcode/problems/find-the-largest-area-of-square-inside-two-rectangles.h

@@ -0,0 +1,19 @@
+
+#include "leetcode/core.h"
+
+namespace leetcode {
+namespace problem_3047 {
+
+using Func = std::function<long long(vector<vector<int>>&, vector<vector<int>>&)>;
+
+class FindTheLargestAreaOfSquareInsideTwoRectanglesSolution : public SolutionBase<Func> {
+ public:
+  //! 3047. Find the Largest Area of Square Inside Two Rectangles
+  //! https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/
+  long long largestSquareArea(vector<vector<int>>& bottomLeft, vector<vector<int>>& topRight);
+
+  FindTheLargestAreaOfSquareInsideTwoRectanglesSolution();
+};
+
+}  // namespace problem_3047
+}  // namespace leetcode

src/leetcode/problems/find-the-largest-area-of-square-inside-two-rectangles.cpp

@@ -0,0 +1,46 @@
+
+#include "leetcode/problems/find-the-largest-area-of-square-inside-two-rectangles.h"
+
+namespace leetcode {
+namespace problem_3047 {
+
+// 枚举所有矩形对，计算相交区域的最大正方形面积
+// 时间复杂度: O(n²), 空间复杂度: O(1)
+static long long solution1(vector<vector<int>>& bottomLeft, vector<vector<int>>& topRight) {
+  const int n = bottomLeft.size();
+  long long maxArea = 0;
+  for (int i = 0; i < n; ++i) {
+    for (int j = i + 1; j < n; ++j) {
+      // 计算相交区域的左下角和右上角
+      int x1 = max(bottomLeft[i][0], bottomLeft[j][0]);
+      int y1 = max(bottomLeft[i][1], bottomLeft[j][1]);
+      int x2 = min(topRight[i][0], topRight[j][0]);
+      int y2 = min(topRight[i][1], topRight[j][1]);
+      // 检查是否相交
+      if (x1 < x2 && y1 < y2) {
+        long long width = x2 - x1;
+        long long height = y2 - y1;
+        long long side = min(width, height);
+        long long area = side * side;
+        if (area > maxArea) {
+          maxArea = area;
+        }
+      }
+    }
+  }
+  return maxArea;
+}
+
+FindTheLargestAreaOfSquareInsideTwoRectanglesSolution::FindTheLargestAreaOfSquareInsideTwoRectanglesSolution() {
+  setMetaInfo({.id = 3047,
+               .title = "Find the Largest Area of Square Inside Two Rectangles",
+               .url = "https://leetcode.com/problems/find-the-largest-area-of-square-inside-two-rectangles/"});
+  registerStrategy("Pairwise Enumeration", solution1);
+}
+
+long long FindTheLargestAreaOfSquareInsideTwoRectanglesSolution::largestSquareArea(vector<vector<int>>& bottomLeft, vector<vector<int>>& topRight) {
+  return getSolution()(bottomLeft, topRight);
+}
+
+}  // namespace problem_3047
+}  // namespace leetcode

test/leetcode/problems/find-the-largest-area-of-square-inside-two-rectangles.cpp

@@ -0,0 +1,67 @@
+
+#include "leetcode/problems/find-the-largest-area-of-square-inside-two-rectangles.h"
+
+#include "gtest/gtest.h"
+
+namespace leetcode {
+namespace problem_3047 {
+
+class FindTheLargestAreaOfSquareInsideTwoRectanglesTest : public ::testing::TestWithParam<string> {
+ protected:
+  void SetUp() override { solution.setStrategy(GetParam()); }
+
+  FindTheLargestAreaOfSquareInsideTwoRectanglesSolution solution;
+};
+
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, Example1) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {2, 2}, {3, 1}};
+  vector<vector<int>> topRight = {{3, 3}, {4, 4}, {6, 6}};
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 1);
+}
+
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, Example2) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {1, 3}, {1, 5}};
+  vector<vector<int>> topRight = {{5, 5}, {5, 7}, {5, 9}};
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 4);
+}
+
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, Example3) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {2, 2}, {1, 2}};
+  vector<vector<int>> topRight = {{3, 3}, {4, 4}, {3, 4}};
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 1);
+}
+
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, Example4) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {3, 3}, {3, 1}};
+  vector<vector<int>> topRight = {{2, 2}, {4, 4}, {4, 2}};
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 0);
+}
+
+// 添加一些额外的测试用例
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, NoIntersection) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {5, 5}};
+  vector<vector<int>> topRight = {{2, 2}, {6, 6}};
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 0);
+}
+
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, PerfectOverlap) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {1, 1}};
+  vector<vector<int>> topRight = {{5, 5}, {5, 5}};
+  // 宽度和高度都是4，最大正方形边长4，面积16
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 16);
+}
+
+TEST_P(FindTheLargestAreaOfSquareInsideTwoRectanglesTest, LargeCoordinates) {
+  vector<vector<int>> bottomLeft = {{1, 1}, {1000000, 1000000}};
+  vector<vector<int>> topRight = {{10000000, 10000000}, {2000000, 2000000}};
+  // 相交区域: x1 = max(1,1000000)=1000000, y1=1000000, x2=min(10000000,2000000)=2000000, y2=min(10000000,2000000)=2000000
+  // 宽度=1000000, 高度=1000000, 边长=1000000, 面积=10^12
+  EXPECT_EQ(solution.largestSquareArea(bottomLeft, topRight), 1000000000000LL);
+}
+
+INSTANTIATE_TEST_SUITE_P(
+    LeetCode, FindTheLargestAreaOfSquareInsideTwoRectanglesTest,
+    ::testing::ValuesIn(FindTheLargestAreaOfSquareInsideTwoRectanglesSolution().getStrategyNames()));
+
+}  // namespace problem_3047
+}  // namespace leetcode