先模1<<16和除 1<<16
所在版块：求学狮城 发贴时间：2007-04-25 16:46

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
两边应该有一边是0，如果两边都不是0，一定就不是2的power了

然后把不为0的那一边再模1<<8和除1<<8

当然这里假设是unsigned int, 32bits
.
欢迎来到华新中文网，踊跃发帖是支持我们的最好方法!

This page is intentionally left blank
　相关帖子 我要回复↙ ↗回到正文
programming puzzles － 吴永铮 　2007-04-24 17:12 (476 bytes , 737reads )
my answer to (4) － 吴永铮 　2007-04-27 21:56 (284 bytes , 253reads )
(Y) － hash 　2007-04-29 04:42 (0 bytes , 226reads )
what do you mean by classic way? － icky 　2007-04-25 11:33 (96 bytes , 266reads )
(3) can be done by less than 5 instructions － 吴永铮 　2007-04-25 12:26 (66 bytes , 256reads )
check equality with all 2's power － icky 　2007-04-25 12:56 (31 bytes , 292reads )
can be simpler and faster － 吴永铮 　2007-04-25 15:26 (0 bytes , 226reads )
先模1<<16和除 1<<16 － icky 　2007-04-25 16:46 (130 bytes , 247reads )
(num > 0) && (((num - 1) & num) == 0) ? － 这就是生活 　2007-04-26 00:31 (0 bytes , 266reads )
correct － 吴永铮 　2007-04-26 00:50 (177 bytes , 233reads )
opps ^ is wrong. It's always true. － 吴永铮 　2007-04-26 01:06 (0 bytes , 244reads )
i was thinking of checking bit also. － hash 　2007-04-25 11:36 (18 bytes , 256reads )
interesting... let me try 1&2... － hash 　2007-04-24 18:10 (106 bytes , 381reads )
oh, i was thinking using while － icky 　2007-04-25 11:34 (55 bytes , 302reads )
世界真奇妙 － soc胖浪人 　2007-04-25 00:27 (0 bytes , 201reads )