You’ve got an integer i. Your task: Check if the binary representation of i contains exactly one 1 bit. How would you tackle it?

2024-11-17 10:31

讚

回覆

轉發

粉絲

串文

91+

無資料

(讚 + 回覆 + 轉發) / 粉絲數

Infinity%

最先回覆的內容
發文後	用戶	內容
3 小時內	Kevin Maguire k.c.f.maguire	Then irs a power of 2. Just check it against a list of 1,2,4,…
13 小時內	Everett Richards everettisaperson	Let W be a row vector corresponding to the binary representation of i. Construct a vertical column vector V of the same length as W, with a 1 in each position. Take the dot product of W and V, and check if it's equal to 1.