Click here to see the full article post
@devilhtc Would you explain why?
- You can always choose m to be the smaller one
- 2log(max(m,n)) = log(max(m,n)^2) >= log(m∗n)
Hence O(m∗log(m∗n)) is O(min(m,n)*log(max(m,n))
@devilhtc Thanks a lot!
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.