Number Of Rectangles That Can Form The Largest Square LeetCode solution in C++

1
class Solution {
2
 public:
3
  int countGoodRectangles(const vector<vector<int>> &rectangles) {
4
    int side = 0, maxLen = 0, count = 0;
5

6
    for (const auto &i : rectangles) {
7
      side = min(i[0], i[1]);
8

9
      if (maxLen < side) {
10
        maxLen = side;
11
        count = 1;
12
      } else if (maxLen == side)
13
        ++count;
14
    }
15

16
    return count;
17
  }
18
};