No self-introduction
Loading
Profile
Follow
codes (2)
Optimal binary search trees
no vote
C [I, J] means that from point I + 1, I + 2 to point J, choose any point as the root, and find the optimal solution with the lowest cost among (J-I) solutions
chenjinfu 2 0
1
Non-recursive solution the Fibonacci sequence prob
no vote
Disadvantages of recursion:
chenjinfu 0 0
1
No more~
Follows0
Fans0