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

1
class Solution {
2
  public int countGoodRectangles(int[][] rectangles) {
3
    List<Integer> list = new LinkedList<Integer>();
4
    int max = 0, count = 0;
5
    for (int i = 0; i < rectangles.length; i++) {
6
      if (rectangles[i][0] > rectangles[i][1]) {
7
        list.add(rectangles[i][1]);
8
        if (max < rectangles[i][1]) max = rectangles[i][1];
9
      } else {
10
        list.add(rectangles[i][0]);
11
        if (max < rectangles[i][0]) max = rectangles[i][0];
12
      }
13
    }
14
    for (Integer i : list) {
15
      if (i == max) count++;
16
    }
17
    return count;
18
  }
19
}