2019年4月29日
[Algorithm] Calculate Pow(x,n) using recursion
摘要： Asking you to implement the Math.pow method The navie implemenation can be: It takes O(N) time. Now if we want to improve it to O(logN) time. we can d 阅读全文
posted @ 2019-04-29 22:17 Zhentiw 阅读(222) 评论(0) 推荐(0)
[Vuex] Use Namespaces in Vuex Stores using TypeScript
摘要： Even by using modules, they still share the same namespace. So you couldn’t have the same mutation name in different modules. Namespaces solve that by 阅读全文
posted @ 2019-04-29 13:26 Zhentiw 阅读(1963) 评论(0) 推荐(0)
[Algorithm] Fibonacci Sequence - Anatomy of recursion and space complexity analysis
摘要： For Fibonacci Sequence, the space complexity should be the O(logN), which is the height of tree. Check the source 阅读全文
posted @ 2019-04-29 01:18 Zhentiw 阅读(331) 评论(0) 推荐(0)