For Fibonacci Sequence, the space complexity should be the O(logN), which is the height of tree.
Check the source
[Algorithm] Fibonacci Sequence - Anatomy of recursion and space complexity analysis
猜你喜欢
转载自www.cnblogs.com/Answer1215/p/10788126.html
今日推荐
周排行