摘要:
Given a range [m, n] where 0 m位数,一定会出现100…0的情况,AND的结果为100…00如果n位数=m位数,从最高位开始分析,如果n和m该位上的数字相等,考虑下一位,直到某位上n=1,m=0(因为n>m)。到这种情况时,一定又会出现100…0的情况,所以后面的这些数字... 阅读全文
posted @ 2015-05-09 16:59
amazingzoe
阅读(117)
评论(0)
推荐(0)
摘要:
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer... 阅读全文
posted @ 2015-05-09 13:41
amazingzoe
阅读(231)
评论(0)
推荐(0)
摘要:
Description:Count the number of prime numbers less than a non-negative number,nclick to show more hints.References:How Many Primes Are There?Sieve of ... 阅读全文
posted @ 2015-05-09 12:21
amazingzoe
阅读(136)
评论(0)
推荐(0)
浙公网安备 33010602011771号