摘要:
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 阅读全文
posted @ 2018-01-04 21:53
zeroingToOne
阅读(236)
评论(0)
推荐(0)
摘要:
Given an integer, write a function to determine if it is a power of two. Credits:Special thanks to @jianchao.li.fighter for adding this problem and cr 阅读全文
posted @ 2018-01-04 20:14
zeroingToOne
阅读(199)
评论(0)
推荐(0)

浙公网安备 33010602011771号