LeetCode - Pow(x,n)
Binary Divided Solver.
Recursion.(not the tail-recursion, so cannot transform to non-recursion)
Attention to:
1. overflow.(up-overflow/down-overflow).
2. input conditions: positive/negtive/precision.
posted on 2013-04-14 17:30 highstar88 阅读(104) 评论(0) 编辑 收藏 举报
