【第三轮】7.24-7.31 CareerCup 5.2

【解题思路】
if number is no less than 0.5, that bit is 1, otherwise 0. Then multiply that remain number with 2 for the next bit.
【时间复杂度】
O(d), d is the number of bits
【空间复杂度】
O(1)
【gist link】
https://gist.github.com/iwilbert/b562f5d2cdb8ba0f8af5

【解题思路】Recursion, compare the remaining value vs. 2^n till 32 bits
【时间复杂度】
O(1)
【空间复杂度】
O(1)
【gist link】
https://gist.github.com/bitcpf/525dec151918061e350b