leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

max_area_longest_diag_rect.c (1305B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// 3000. Maximum Area of Longest Diagonal Rectangle
#include "leetcode.h"

/*
 * you are given a 2d 0-indexed integer array 'dimensions'. for all indices 'i',
 * '0 <= i < dimensions.size', 'dimensions[i][0]' represents the length and
 * 'dimensions[i][1]' represents the width of the rectangle 'i'. return the area
 * of the rectangle having the longest diagonal, return the area of the
 * rectangle having the maximum area.
 */

int areaOfMaxDiagonal(int **dimensions, int dimensionsSize,
                      int *dimensionsColSize) {
  int ans = 0, max = 0;
  for (int i = 0; i < dimensionsSize; i++) {
    int l = dimensions[i][0], w = dimensions[i][1];
    int curr = l * l + w * w;
    if (curr > max || (curr == max && l * w > ans)) {
      max = curr;
      ans = l * w;
    }
  }
  return ans;
}

int main() {
  int d1i[2][2] = {{9, 3}, {8, 6}}, d2i[2][2] = {{3, 4}, {4, 3}};
  struct two_d_arr *d1 =
      two_d_arr_init(ARRAY_SIZE(d1i), ARRAY_SIZE(d1i[0]), d1i);
  struct two_d_arr *d2 =
      two_d_arr_init(ARRAY_SIZE(d2i), ARRAY_SIZE(d2i[0]), d2i);
  printf("%d\n",
         areaOfMaxDiagonal(d1->arr, d1->row_size, d1->col_size)); // expect: 48
  printf("%d\n",
         areaOfMaxDiagonal(d2->arr, d2->row_size, d2->col_size)); // expect: 12
  two_d_arr_free(d1);
  two_d_arr_free(d2);
}