LeetCode Weekly Contest 28
No one has replied
good way of counting L
Amazing! And we could further improve performance from O(6^3 log n) to O(3^3 log n) by deviding matrix P into:
So matrix addition / multiplication costs O(3^3) because:
This is my C++ implementation below:
@dettier good clean code.
whats the complexity of love_fown solution ?
@rjtsdl Of course not. We aren't talking about integer division, we are talking about float division as written in the problem statement "Given a list of positive integers, the adjacent integers will perform the float division" .
Disabled Categories are greyed out
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.