LeetCode 963. Minimum Area Rectangle II

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Finding such a good python explanation was hard, Thank you

siesfjt
Автор

is the time complexity for approach 2 O(N^2)? saw on 力扣 there's a similar approach w/ O(N^2 * logN).

monicawang
Автор

What if all the diagonals are of same length and passing though same center point, then the time complexity would be (n)^4, isn' t it ?

saini