problemscpp
A collection of my answers to algorithm problems in c++.
| 函数
leetcode::number_of_rectangles_that_can_form_the_largest_square 命名空间参考

LeetCode 1725. 可以形成最大正方形的矩形数目 更多...

class  Solution
 

函数

 TEST (number_of_rectangles_that_can_form_the_largest_square, case1)
 
 TEST (number_of_rectangles_that_can_form_the_largest_square, case2)
 

详细描述

LeetCode 1725. 可以形成最大正方形的矩形数目

函数说明

◆ TEST() [1/2]

leetcode::number_of_rectangles_that_can_form_the_largest_square::TEST ( number_of_rectangles_that_can_form_the_largest_square  ,
case1   
)

在文件 leetcode_test.cpp1253 行定义.

1253 {
1254 vector<vector<int>> input = {{5, 8}, {3, 9}, {5, 12}, {16, 5}};
1255 ASSERT_EQ(3, Solution::countGoodRectangles(input));
1256 }

引用了 leetcode::number_of_rectangles_that_can_form_the_largest_square::Solution::countGoodRectangles().

◆ TEST() [2/2]

leetcode::number_of_rectangles_that_can_form_the_largest_square::TEST ( number_of_rectangles_that_can_form_the_largest_square  ,
case2   
)

在文件 leetcode_test.cpp1258 行定义.

1258 {
1259 vector<vector<int>> input = {{2, 3}, {3, 7}, {4, 3}, {3, 7}};
1260 ASSERT_EQ(3, Solution::countGoodRectangles(input));
1261 }

引用了 leetcode::number_of_rectangles_that_can_form_the_largest_square::Solution::countGoodRectangles().