问道careercup 150 题目的复杂度# JobHunting - 待字闺中
j*s
1 楼
9.10 n boxs, height,width,depth, find the max height.
Solution,
Sub-problem, find the max depth that is using box b_i as bottom. Using
recursion + cache.
请问各位大神算法的复杂度是多少,怎么得出来的?谢谢!
Solution,
Sub-problem, find the max depth that is using box b_i as bottom. Using
recursion + cache.
请问各位大神算法的复杂度是多少,怎么得出来的?谢谢!